/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/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:12:29,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:12:29,537 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 00:12:29,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:12:29,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:12:29,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:12:29,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:12:29,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:12:29,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:12:29,568 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:12:29,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:12:29,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:12:29,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:12:29,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:12:29,570 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:12:29,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:12:29,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:12:29,571 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:12:29,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:12:29,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:12:29,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:12:29,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:12:29,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:12:29,573 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:12:29,573 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:12:29,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:12:29,574 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:12:29,574 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:12:29,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:12:29,574 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:12:29,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:12:29,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:12:29,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:12:29,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:12:29,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:12:29,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:12:29,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:12:29,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:12:29,576 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:12:29,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:12:29,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:12:29,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:12:29,577 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:12:29,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:12:29,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:12:29,577 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:12:29,577 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 00:12:29,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:12:29,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:12:29,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:12:29,805 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:12:29,805 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:12:29,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2023-12-25 00:12:30,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:12:31,040 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:12:31,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2023-12-25 00:12:31,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc7635a65/867597e9af8f482db725d22f3bc52e70/FLAG24a8ca997 [2023-12-25 00:12:31,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc7635a65/867597e9af8f482db725d22f3bc52e70 [2023-12-25 00:12:31,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:12:31,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:12:31,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:12:31,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:12:31,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:12:31,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65da4906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31, skipping insertion in model container [2023-12-25 00:12:31,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:12:31,200 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/cohendiv-ll.c[576,589] [2023-12-25 00:12:31,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:12:31,219 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:12:31,228 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/cohendiv-ll.c[576,589] [2023-12-25 00:12:31,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:12:31,243 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:12:31,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31 WrapperNode [2023-12-25 00:12:31,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:12:31,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:12:31,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:12:31,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:12:31,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,266 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2023-12-25 00:12:31,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:12:31,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:12:31,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:12:31,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:12:31,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,291 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 00:12:31,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:12:31,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:12:31,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:12:31,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:12:31,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (1/1) ... [2023-12-25 00:12:31,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:12:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:12:31,363 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 00:12:31,404 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 00:12:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:12:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:12:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:12:31,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:12:31,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:12:31,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:12:31,507 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:12:31,511 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:12:31,692 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:12:31,723 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:12:31,723 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 00:12:31,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:12:31 BoogieIcfgContainer [2023-12-25 00:12:31,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:12:31,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:12:31,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:12:31,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:12:31,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:12:31" (1/3) ... [2023-12-25 00:12:31,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37393c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:12:31, skipping insertion in model container [2023-12-25 00:12:31,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:12:31" (2/3) ... [2023-12-25 00:12:31,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37393c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:12:31, skipping insertion in model container [2023-12-25 00:12:31,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:12:31" (3/3) ... [2023-12-25 00:12:31,730 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.c [2023-12-25 00:12:31,744 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:12:31,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:12:31,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:12:31,780 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;@70a18630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:12:31,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:12:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 00:12:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 00:12:31,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:12:31,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:12:31,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:12:31,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:12:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1529312357, now seen corresponding path program 1 times [2023-12-25 00:12:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:12:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889597905] [2023-12-25 00:12:31,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:12:31,801 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 00:12:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:12:31,812 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 00:12:31,813 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 00:12:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:12:31,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:12:31,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:12:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:12:31,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:12:31,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:12:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889597905] [2023-12-25 00:12:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889597905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:12:31,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:12:31,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:12:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110532383] [2023-12-25 00:12:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:12:31,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:12:31,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:12:31,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:12:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:12:31,958 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:12:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:12:31,981 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2023-12-25 00:12:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:12:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 00:12:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:12:31,987 INFO L225 Difference]: With dead ends: 46 [2023-12-25 00:12:31,988 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 00:12:31,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 00:12:32,007 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:12:32,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:12:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 00:12:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 00:12:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:12:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2023-12-25 00:12:32,035 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 8 [2023-12-25 00:12:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:12:32,035 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-12-25 00:12:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:12:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2023-12-25 00:12:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 00:12:32,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:12:32,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:12:32,041 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 00:12:32,240 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 00:12:32,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:12:32,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:12:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash -989158027, now seen corresponding path program 1 times [2023-12-25 00:12:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:12:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242459235] [2023-12-25 00:12:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:12:32,243 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 00:12:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:12:32,245 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 00:12:32,267 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 00:12:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:12:32,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:12:32,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:12:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:12:32,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:12:32,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:12:32,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242459235] [2023-12-25 00:12:32,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242459235] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:12:32,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:12:32,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 00:12:32,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514447825] [2023-12-25 00:12:32,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:12:32,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:12:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:12:32,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:12:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:12:32,513 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.0) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:12:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:12:33,549 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2023-12-25 00:12:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:12:33,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.0) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 00:12:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:12:33,551 INFO L225 Difference]: With dead ends: 33 [2023-12-25 00:12:33,551 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 00:12:33,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:12:33,552 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:12:33,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 97 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 00:12:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 00:12:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-25 00:12:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 00:12:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-25 00:12:33,560 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 8 [2023-12-25 00:12:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:12:33,561 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-25 00:12:33,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.0) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:12:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-25 00:12:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-25 00:12:33,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:12:33,561 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:12:33,575 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 (3)] Ended with exit code 0 [2023-12-25 00:12:33,762 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 00:12:33,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:12:33,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:12:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1030743109, now seen corresponding path program 1 times [2023-12-25 00:12:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:12:33,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049678040] [2023-12-25 00:12:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:12:33,764 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 00:12:33,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:12:33,765 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 00:12:33,773 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 00:12:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:12:33,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:12:33,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:12:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:12:34,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:12:34,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:12:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049678040] [2023-12-25 00:12:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049678040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:12:34,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:12:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 00:12:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145013668] [2023-12-25 00:12:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:12:34,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:12:34,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:12:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:12:34,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:12:34,004 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 00:12:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:12:35,194 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-25 00:12:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:12:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-25 00:12:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:12:35,199 INFO L225 Difference]: With dead ends: 45 [2023-12-25 00:12:35,199 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 00:12:35,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:12:35,201 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:12:35,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 00:12:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 00:12:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-25 00:12:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 00:12:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2023-12-25 00:12:35,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 13 [2023-12-25 00:12:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:12:35,209 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2023-12-25 00:12:35,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 00:12:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2023-12-25 00:12:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 00:12:35,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:12:35,210 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:12:35,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 00:12:35,415 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 00:12:35,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:12:35,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:12:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash -392622754, now seen corresponding path program 1 times [2023-12-25 00:12:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:12:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035630762] [2023-12-25 00:12:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:12:35,417 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 00:12:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:12:35,422 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 00:12:35,423 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 00:12:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:12:35,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:12:35,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:12:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:12:35,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:12:35,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:12:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035630762] [2023-12-25 00:12:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035630762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:12:35,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:12:35,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 00:12:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715154522] [2023-12-25 00:12:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:12:35,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:12:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:12:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:12:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:12:35,776 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:12:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:12:36,913 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2023-12-25 00:12:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:12:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-12-25 00:12:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:12:36,914 INFO L225 Difference]: With dead ends: 67 [2023-12-25 00:12:36,914 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 00:12:36,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:12:36,916 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:12:36,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 95 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 00:12:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 00:12:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2023-12-25 00:12:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 00:12:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2023-12-25 00:12:36,930 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 20 [2023-12-25 00:12:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:12:36,930 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2023-12-25 00:12:36,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:12:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2023-12-25 00:12:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 00:12:36,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:12:36,931 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:12:36,939 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 00:12:37,138 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 00:12:37,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:12:37,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:12:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1606383650, now seen corresponding path program 1 times [2023-12-25 00:12:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:12:37,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295814023] [2023-12-25 00:12:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:12:37,140 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 00:12:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:12:37,141 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 00:12:37,180 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 00:12:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:12:37,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:12:37,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:12:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 00:12:37,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:12:37,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:12:37,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295814023] [2023-12-25 00:12:37,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295814023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:12:37,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:12:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 00:12:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719602379] [2023-12-25 00:12:37,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:12:37,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:12:37,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:12:37,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:12:37,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:12:37,390 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:12:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:12:38,644 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-12-25 00:12:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:12:38,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-12-25 00:12:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:12:38,667 INFO L225 Difference]: With dead ends: 64 [2023-12-25 00:12:38,667 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 00:12:38,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:12:38,667 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:12:38,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 98 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 00:12:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 00:12:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 00:12:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 00:12:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2023-12-25 00:12:38,687 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 30 [2023-12-25 00:12:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:12:38,688 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2023-12-25 00:12:38,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:12:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2023-12-25 00:12:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 00:12:38,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:12:38,692 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:12:38,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 00:12:38,902 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 00:12:38,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:12:38,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:12:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1323632488, now seen corresponding path program 1 times [2023-12-25 00:12:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:12:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542307029] [2023-12-25 00:12:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:12:38,903 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 00:12:38,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:12:38,905 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 00:12:38,906 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 00:12:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:12:39,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 00:12:39,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:12:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 00:12:39,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:12:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 00:12:56,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:12:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542307029] [2023-12-25 00:12:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542307029] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:12:56,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:12:56,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-25 00:12:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436494118] [2023-12-25 00:12:56,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:12:56,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 00:12:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:12:56,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 00:12:56,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-12-25 00:12:56,471 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 21 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 00:13:06,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:13:10,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:13:14,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:13:22,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:13:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:13:23,437 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2023-12-25 00:13:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 00:13:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 36 [2023-12-25 00:13:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:13:23,446 INFO L225 Difference]: With dead ends: 92 [2023-12-25 00:13:23,446 INFO L226 Difference]: Without dead ends: 90 [2023-12-25 00:13:23,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2023-12-25 00:13:23,447 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 90 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 90 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:13:23,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 107 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 160 Invalid, 3 Unknown, 0 Unchecked, 21.0s Time] [2023-12-25 00:13:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-25 00:13:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2023-12-25 00:13:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-25 00:13:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2023-12-25 00:13:23,475 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 36 [2023-12-25 00:13:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:13:23,476 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2023-12-25 00:13:23,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 00:13:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2023-12-25 00:13:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 00:13:23,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:13:23,477 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:13:23,484 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 00:13:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:13:23,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:13:23,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:13:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 927151240, now seen corresponding path program 1 times [2023-12-25 00:13:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:13:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860540291] [2023-12-25 00:13:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:13:23,686 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 00:13:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:13:23,687 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:13:23,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 00:13:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:13:23,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:13:23,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:13:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 00:13:24,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:13:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 00:13:55,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:13:55,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860540291] [2023-12-25 00:13:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860540291] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:13:55,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:13:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2023-12-25 00:13:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556351932] [2023-12-25 00:13:55,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:13:55,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 00:13:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:13:55,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 00:13:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-25 00:13:55,858 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 00:14:08,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:14:16,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:14:20,432 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 00:14:24,446 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 00:14:31,705 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 00:14:34,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:14:36,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:14:47,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:14:51,800 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 00:14:55,813 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 00:14:58,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:15:01,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:15:05,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:15:09,723 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 00:15:13,735 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 00:15:19,168 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 00:15:23,180 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 00:15:27,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:15:30,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:15:33,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:15:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:15:33,122 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2023-12-25 00:15:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 00:15:33,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2023-12-25 00:15:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:15:33,139 INFO L225 Difference]: With dead ends: 138 [2023-12-25 00:15:33,139 INFO L226 Difference]: Without dead ends: 91 [2023-12-25 00:15:33,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2023-12-25 00:15:33,148 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 74 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 87 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:15:33,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 133 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 229 Invalid, 13 Unknown, 0 Unchecked, 81.9s Time] [2023-12-25 00:15:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-25 00:15:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-12-25 00:15:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 57 states have internal predecessors, (59), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-25 00:15:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2023-12-25 00:15:33,174 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 43 [2023-12-25 00:15:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:15:33,175 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2023-12-25 00:15:33,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 00:15:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2023-12-25 00:15:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 00:15:33,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:15:33,179 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:15:33,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 00:15:33,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:15:33,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:15:33,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:15:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1669305380, now seen corresponding path program 1 times [2023-12-25 00:15:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:15:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982036288] [2023-12-25 00:15:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:15:33,387 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 00:15:33,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:15:33,388 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 00:15:33,390 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 00:15:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:15:33,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 00:15:33,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:15:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-12-25 00:15:35,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:15:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-12-25 00:15:37,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:15:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982036288] [2023-12-25 00:15:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982036288] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:15:37,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:15:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2023-12-25 00:15:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320352859] [2023-12-25 00:15:37,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:15:37,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 00:15:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:15:37,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 00:15:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:15:37,221 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 00:15:43,458 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 00:15:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:15:43,930 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2023-12-25 00:15:43,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 00:15:43,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2023-12-25 00:15:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:15:43,931 INFO L225 Difference]: With dead ends: 96 [2023-12-25 00:15:43,931 INFO L226 Difference]: Without dead ends: 94 [2023-12-25 00:15:43,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:15:43,932 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:15:43,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2023-12-25 00:15:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-25 00:15:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2023-12-25 00:15:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 54 states have internal predecessors, (57), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 00:15:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2023-12-25 00:15:43,948 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 61 [2023-12-25 00:15:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:15:43,951 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2023-12-25 00:15:43,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 00:15:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2023-12-25 00:15:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 00:15:43,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:15:43,952 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:15:43,982 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 00:15:44,156 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 00:15:44,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:15:44,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:15:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1706413794, now seen corresponding path program 1 times [2023-12-25 00:15:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:15:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375676678] [2023-12-25 00:15:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:15:44,157 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 00:15:44,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:15:44,158 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 00:15:44,160 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 00:15:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:15:44,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 00:15:44,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:15:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 00:15:45,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:16:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 00:16:01,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:16:01,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375676678] [2023-12-25 00:16:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375676678] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:16:01,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:16:01,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2023-12-25 00:16:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048274332] [2023-12-25 00:16:01,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:16:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 00:16:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:16:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 00:16:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-12-25 00:16:01,715 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 20 states have internal predecessors, (37), 12 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2023-12-25 00:16:12,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:16:16,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:16:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:16:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:16:24,418 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2023-12-25 00:16:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 00:16:24,430 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 20 states have internal predecessors, (37), 12 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) Word has length 66 [2023-12-25 00:16:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:16:24,431 INFO L225 Difference]: With dead ends: 120 [2023-12-25 00:16:24,431 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 00:16:24,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2023-12-25 00:16:24,432 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 53 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:16:24,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 243 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 399 Invalid, 3 Unknown, 0 Unchecked, 18.8s Time] [2023-12-25 00:16:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 00:16:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2023-12-25 00:16:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.078125) internal successors, (69), 66 states have internal predecessors, (69), 24 states have call successors, (24), 14 states have call predecessors, (24), 14 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 00:16:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-12-25 00:16:24,445 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 66 [2023-12-25 00:16:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:16:24,446 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-12-25 00:16:24,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 20 states have internal predecessors, (37), 12 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2023-12-25 00:16:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-12-25 00:16:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 00:16:24,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:16:24,447 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:16:24,457 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 00:16:24,652 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 00:16:24,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:16:24,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:16:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 928426792, now seen corresponding path program 2 times [2023-12-25 00:16:24,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:16:24,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907524683] [2023-12-25 00:16:24,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:16:24,653 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 00:16:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:16:24,654 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 00:16:24,655 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 00:16:24,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:16:24,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:16:24,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 00:16:24,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:16:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 63 proven. 48 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-25 00:16:25,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:17:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 63 proven. 48 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-25 00:17:30,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:17:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907524683] [2023-12-25 00:17:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907524683] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:17:30,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:17:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-12-25 00:17:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687353351] [2023-12-25 00:17:30,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:17:30,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 00:17:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:17:30,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 00:17:30,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-12-25 00:17:30,515 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 15 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 12 states have call predecessors, (26), 13 states have call successors, (26) [2023-12-25 00:17:43,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:17:57,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:18:21,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:18:28,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:18:40,630 WARN L293 SmtUtils]: Spent 6.54s 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 00:18:41,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:19:21,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:19:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:19:32,636 INFO L93 Difference]: Finished difference Result 168 states and 211 transitions. [2023-12-25 00:19:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 00:19:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 15 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 12 states have call predecessors, (26), 13 states have call successors, (26) Word has length 82 [2023-12-25 00:19:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:19:32,646 INFO L225 Difference]: With dead ends: 168 [2023-12-25 00:19:32,646 INFO L226 Difference]: Without dead ends: 166 [2023-12-25 00:19:32,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 117.1s TimeCoverageRelationStatistics Valid=538, Invalid=1718, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 00:19:32,647 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 155 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 175 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:19:32,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 222 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 422 Invalid, 1 Unknown, 0 Unchecked, 44.0s Time] [2023-12-25 00:19:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-25 00:19:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2023-12-25 00:19:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 91 states have (on average 1.120879120879121) internal successors, (102), 93 states have internal predecessors, (102), 48 states have call successors, (48), 17 states have call predecessors, (48), 17 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-25 00:19:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2023-12-25 00:19:32,679 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 82 [2023-12-25 00:19:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:19:32,680 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2023-12-25 00:19:32,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 15 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 12 states have call predecessors, (26), 13 states have call successors, (26) [2023-12-25 00:19:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2023-12-25 00:19:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 00:19:32,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:19:32,682 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:19:32,693 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 00:19:32,896 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 00:19:32,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:19:32,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:19:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1270919211, now seen corresponding path program 2 times [2023-12-25 00:19:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:19:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261426165] [2023-12-25 00:19:32,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:19:32,897 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 00:19:32,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:19:32,898 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 00:19:32,900 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 00:19:33,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:19:33,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:19:33,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 00:19:33,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:19:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 734 proven. 99 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2023-12-25 00:19:36,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:22:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 293 proven. 214 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2023-12-25 00:22:11,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:22:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261426165] [2023-12-25 00:22:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261426165] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:22:11,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:22:11,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2023-12-25 00:22:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389277758] [2023-12-25 00:22:11,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:22:11,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 00:22:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:22:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 00:22:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 00:22:11,962 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 29 states have internal predecessors, (58), 23 states have call successors, (48), 2 states have call predecessors, (48), 3 states have return successors, (48), 23 states have call predecessors, (48), 23 states have call successors, (48) [2023-12-25 00:22:56,848 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 00:23:09,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:23:13,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:23:23,115 WARN L293 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 92 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:23:30,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:24:06,414 WARN L293 SmtUtils]: Spent 15.48s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:24:11,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:24:29,314 WARN L293 SmtUtils]: Spent 9.39s on a formula simplification. DAG size of input: 88 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:24:33,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:24:58,020 WARN L293 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 74 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:25:52,180 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 73 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:26:19,270 WARN L293 SmtUtils]: Spent 12.81s on a formula simplification. DAG size of input: 58 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:26:42,561 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 59 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:27:07,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 00:27:15,513 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 00:27:15,539 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:27:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 00:27:15,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 306.6s TimeCoverageRelationStatistics Valid=558, Invalid=2747, Unknown=1, NotChecked=0, Total=3306 [2023-12-25 00:27:15,731 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 144 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 227 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:27:15,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 412 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 682 Invalid, 4 Unknown, 0 Unchecked, 79.0s Time] [2023-12-25 00:27:15,732 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:27:15,749 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 (12)] Ended with exit code 0 [2023-12-25 00:27:15,933 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 00:27:15,933 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (157states) and FLOYD_HOARE automaton (currently 33 states, 34 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates. [2023-12-25 00:27:15,937 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:27:15,938 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:27:15,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:27:15 BoogieIcfgContainer [2023-12-25 00:27:15,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:27:15,940 INFO L158 Benchmark]: Toolchain (without parser) took 884862.65ms. Allocated memory was 211.8MB in the beginning and 320.9MB in the end (delta: 109.1MB). Free memory was 150.7MB in the beginning and 177.3MB in the end (delta: -26.5MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2023-12-25 00:27:15,940 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory was 162.9MB in the beginning and 162.8MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:27:15,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.63ms. Allocated memory is still 211.8MB. Free memory was 150.7MB in the beginning and 139.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:27:15,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.13ms. Allocated memory is still 211.8MB. Free memory was 139.2MB in the beginning and 137.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:27:15,941 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 211.8MB. Free memory was 137.7MB in the beginning and 135.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:27:15,941 INFO L158 Benchmark]: RCFGBuilder took 423.17ms. Allocated memory was 211.8MB in the beginning and 320.9MB in the end (delta: 109.1MB). Free memory was 135.6MB in the beginning and 282.0MB in the end (delta: -146.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2023-12-25 00:27:15,941 INFO L158 Benchmark]: TraceAbstraction took 884214.65ms. Allocated memory is still 320.9MB. Free memory was 281.5MB in the beginning and 177.3MB in the end (delta: 104.2MB). Peak memory consumption was 104.2MB. Max. memory is 8.0GB. [2023-12-25 00:27:15,942 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.12ms. Allocated memory is still 211.8MB. Free memory was 162.9MB in the beginning and 162.8MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.63ms. Allocated memory is still 211.8MB. Free memory was 150.7MB in the beginning and 139.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.13ms. Allocated memory is still 211.8MB. Free memory was 139.2MB in the beginning and 137.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 211.8MB. Free memory was 137.7MB in the beginning and 135.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 423.17ms. Allocated memory was 211.8MB in the beginning and 320.9MB in the end (delta: 109.1MB). Free memory was 135.6MB in the beginning and 282.0MB in the end (delta: -146.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * TraceAbstraction took 884214.65ms. Allocated memory is still 320.9MB. Free memory was 281.5MB in the beginning and 177.3MB in the end (delta: 104.2MB). Peak memory consumption was 104.2MB. 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: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was constructing difference of abstraction (157states) and FLOYD_HOARE automaton (currently 33 states, 34 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.2s, OverallIterations: 11, TraceHistogramMax: 27, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 584.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 255.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 1574 SdHoareTripleChecker+Invalid, 247.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1342 mSDsCounter, 654 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2251 IncrementalHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 654 mSolverCounterUnsat, 232 mSDtfsCounter, 2251 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1036 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 496.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, InterpolantAutomatonStates: 120, 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, 50 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 295.1s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 954 ConstructedInterpolants, 75 QuantifiedInterpolants, 6742 SizeOfPredicates, 56 NumberOfNonLiveVariables, 905 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 4173/4660 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