/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:03:40,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:03:40,277 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 05:03:40,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:03:40,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:03:40,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:03:40,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:03:40,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:03:40,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:03:40,316 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:03:40,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:03:40,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:03:40,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:03:40,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:03:40,319 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:03:40,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:03:40,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:03:40,319 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:03:40,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:03:40,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:03:40,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:03:40,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:03:40,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:03:40,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:03:40,321 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:03:40,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:03:40,322 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:03:40,322 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:03:40,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:03:40,322 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:03:40,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:03:40,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:03:40,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:03:40,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:03:40,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:03:40,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:03:40,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:03:40,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:03:40,324 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:03:40,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:03:40,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:03:40,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:03:40,324 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:03:40,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:03:40,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:03:40,325 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:03:40,325 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 05:03:40,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:03:40,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:03:40,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:03:40,583 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:03:40,585 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:03:40,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2023-12-25 05:03:41,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:03:41,942 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:03:41,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2023-12-25 05:03:41,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad6e7d5db/6e0e1472e13045ae9fcd42c493942c20/FLAGd36438be9 [2023-12-25 05:03:41,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad6e7d5db/6e0e1472e13045ae9fcd42c493942c20 [2023-12-25 05:03:41,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:03:41,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:03:41,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:03:41,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:03:41,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:03:41,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:03:41" (1/1) ... [2023-12-25 05:03:41,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6cdcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:41, skipping insertion in model container [2023-12-25 05:03:41,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:03:41" (1/1) ... [2023-12-25 05:03:41,988 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:03:42,108 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c[458,471] [2023-12-25 05:03:42,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:03:42,150 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:03:42,160 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c[458,471] [2023-12-25 05:03:42,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:03:42,183 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:03:42,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42 WrapperNode [2023-12-25 05:03:42,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:03:42,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:03:42,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:03:42,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:03:42,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,212 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-12-25 05:03:42,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:03:42,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:03:42,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:03:42,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:03:42,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,232 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 05:03:42,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:03:42,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:03:42,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:03:42,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:03:42,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (1/1) ... [2023-12-25 05:03:42,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:03:42,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:03:42,272 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 05:03:42,280 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 05:03:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:03:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:03:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:03:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:03:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 05:03:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 05:03:42,378 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:03:42,381 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:03:42,735 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:03:42,764 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:03:42,764 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:03:42,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:03:42 BoogieIcfgContainer [2023-12-25 05:03:42,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:03:42,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:03:42,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:03:42,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:03:42,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:03:41" (1/3) ... [2023-12-25 05:03:42,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552aee30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:03:42, skipping insertion in model container [2023-12-25 05:03:42,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:42" (2/3) ... [2023-12-25 05:03:42,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552aee30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:03:42, skipping insertion in model container [2023-12-25 05:03:42,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:03:42" (3/3) ... [2023-12-25 05:03:42,778 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound5.c [2023-12-25 05:03:42,796 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:03:42,796 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:03:42,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:03:42,845 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;@77fd4259, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:03:42,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:03:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 05:03:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 05:03:42,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:42,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:42,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:42,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash 793793432, now seen corresponding path program 1 times [2023-12-25 05:03:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:42,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988799494] [2023-12-25 05:03:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:42,872 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 05:03:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:42,874 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 05:03:42,907 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 05:03:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:43,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:03:43,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:43,072 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 05:03:43,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:03:43,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988799494] [2023-12-25 05:03:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988799494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:03:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:03:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:03:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94496833] [2023-12-25 05:03:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:03:43,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:03:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:03:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:03:43,154 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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 05:03:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:43,187 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2023-12-25 05:03:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:03:43,189 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 05:03:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:43,194 INFO L225 Difference]: With dead ends: 32 [2023-12-25 05:03:43,194 INFO L226 Difference]: Without dead ends: 15 [2023-12-25 05:03:43,196 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 05:03:43,199 INFO L413 NwaCegarLoop]: 18 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, 18 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 05:03:43,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:03:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-25 05:03:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-25 05:03:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 05:03:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-25 05:03:43,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2023-12-25 05:03:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:43,226 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-25 05:03:43,226 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 05:03:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-25 05:03:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 05:03:43,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:43,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:43,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 05:03:43,436 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 05:03:43,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:43,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1922989550, now seen corresponding path program 1 times [2023-12-25 05:03:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806452083] [2023-12-25 05:03:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:43,438 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 05:03:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:43,441 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 05:03:43,442 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 05:03:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:43,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 05:03:43,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:43,713 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 05:03:43,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:03:43,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806452083] [2023-12-25 05:03:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806452083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:03:43,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:03:43,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:03:43,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134516098] [2023-12-25 05:03:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:03:43,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 05:03:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 05:03:43,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:03:43,735 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 05:03:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:43,775 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-25 05:03:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 05:03:43,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2023-12-25 05:03:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:43,777 INFO L225 Difference]: With dead ends: 25 [2023-12-25 05:03:43,777 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 05:03:43,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:03:43,778 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:03:43,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:03:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 05:03:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 05:03:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 05:03:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-25 05:03:43,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2023-12-25 05:03:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:43,789 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-25 05:03:43,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 05:03:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-25 05:03:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 05:03:43,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:43,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:43,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 05:03:43,998 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 05:03:44,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:44,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1924777010, now seen corresponding path program 1 times [2023-12-25 05:03:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084857768] [2023-12-25 05:03:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:44,001 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 05:03:44,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:44,002 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 05:03:44,004 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 05:03:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:44,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:03:44,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:44,303 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 05:03:44,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:03:44,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084857768] [2023-12-25 05:03:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084857768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:03:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:03:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:03:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747567587] [2023-12-25 05:03:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:03:44,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:03:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:03:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:03:44,307 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 05:03:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:46,413 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-12-25 05:03:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:03:46,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-12-25 05:03:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:46,425 INFO L225 Difference]: With dead ends: 27 [2023-12-25 05:03:46,425 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 05:03:46,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:03:46,426 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:03:46,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 05:03:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 05:03:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 05:03:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 05:03:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-25 05:03:46,431 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2023-12-25 05:03:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:46,431 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-25 05:03:46,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 05:03:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-25 05:03:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:03:46,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:46,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:46,452 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 05:03:46,640 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 05:03:46,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:46,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 76913492, now seen corresponding path program 1 times [2023-12-25 05:03:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756322869] [2023-12-25 05:03:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:46,642 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 05:03:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:46,646 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 05:03:46,648 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 05:03:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:47,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:03:47,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:47,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:03:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:47,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756322869] [2023-12-25 05:03:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756322869] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:03:47,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:03:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 05:03:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300815473] [2023-12-25 05:03:47,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:03:47,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 05:03:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 05:03:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 05:03:47,490 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 05:03:52,344 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 05:03:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:57,182 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2023-12-25 05:03:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 05:03:57,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 05:03:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:57,197 INFO L225 Difference]: With dead ends: 57 [2023-12-25 05:03:57,197 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 05:03:57,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 05:03:57,199 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:03:57,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-12-25 05:03:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 05:03:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-12-25 05:03:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 05:03:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-12-25 05:03:57,206 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 17 [2023-12-25 05:03:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:57,206 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-12-25 05:03:57,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 05:03:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-12-25 05:03:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:03:57,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:57,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:57,222 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 05:03:57,420 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 05:03:57,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:57,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 78700952, now seen corresponding path program 1 times [2023-12-25 05:03:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:57,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572571963] [2023-12-25 05:03:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:57,422 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 05:03:57,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:57,422 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 05:03:57,424 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 05:03:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:57,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 05:03:57,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:58,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:04:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 05:04:27,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:04:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572571963] [2023-12-25 05:04:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572571963] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:04:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:04:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:04:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027213718] [2023-12-25 05:04:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:04:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:04:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:04:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:04:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:04:27,910 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 05:04:33,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:04:34,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:04:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:04:36,766 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-12-25 05:04:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:04:36,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2023-12-25 05:04:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:04:36,767 INFO L225 Difference]: With dead ends: 59 [2023-12-25 05:04:36,767 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 05:04:36,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:04:36,768 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:04:36,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-12-25 05:04:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 05:04:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-12-25 05:04:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 05:04:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-25 05:04:36,783 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 17 [2023-12-25 05:04:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:04:36,783 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-25 05:04:36,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 05:04:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-25 05:04:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 05:04:36,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:04:36,784 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:04:36,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 05:04:37,009 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 05:04:37,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:04:37,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:04:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 731759343, now seen corresponding path program 1 times [2023-12-25 05:04:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:04:37,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908635005] [2023-12-25 05:04:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:04:37,010 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 05:04:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:04:37,012 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 05:04:37,043 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 05:04:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:04:37,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 05:04:37,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:04:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:04:38,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:04:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:04:54,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:04:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908635005] [2023-12-25 05:04:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908635005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:04:54,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:04:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 05:04:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724974086] [2023-12-25 05:04:54,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:04:54,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 05:04:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:04:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 05:04:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 05:04:54,829 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:10,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:05:14,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:05:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:05:19,120 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-25 05:05:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 05:05:19,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-12-25 05:05:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:05:19,141 INFO L225 Difference]: With dead ends: 56 [2023-12-25 05:05:19,141 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 05:05:19,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-25 05:05:19,144 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:05:19,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 136 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-12-25 05:05:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 05:05:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-12-25 05:05:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-12-25 05:05:19,156 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2023-12-25 05:05:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:05:19,156 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-12-25 05:05:19,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-12-25 05:05:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 05:05:19,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:05:19,157 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:05:19,182 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 05:05:19,376 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 05:05:19,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:05:19,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:05:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1074423298, now seen corresponding path program 1 times [2023-12-25 05:05:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:05:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527641474] [2023-12-25 05:05:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:05:19,377 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 05:05:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:05:19,378 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 05:05:19,424 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 05:05:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:05:20,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 05:05:20,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:05:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 05:05:21,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:05:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 05:05:21,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:05:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527641474] [2023-12-25 05:05:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527641474] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:05:21,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:05:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 05:05:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409678364] [2023-12-25 05:05:21,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:05:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 05:05:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:05:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 05:05:21,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 05:05:21,942 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 05:05:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:05:31,986 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2023-12-25 05:05:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 05:05:31,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 46 [2023-12-25 05:05:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:05:31,988 INFO L225 Difference]: With dead ends: 61 [2023-12-25 05:05:31,988 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 05:05:31,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-25 05:05:31,989 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-12-25 05:05:31,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-12-25 05:05:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 05:05:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-25 05:05:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2023-12-25 05:05:32,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2023-12-25 05:05:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:05:32,003 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2023-12-25 05:05:32,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 05:05:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2023-12-25 05:05:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 05:05:32,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:05:32,005 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:05:32,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 05:05:32,220 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 05:05:32,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:05:32,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:05:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1441866883, now seen corresponding path program 2 times [2023-12-25 05:05:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:05:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989502944] [2023-12-25 05:05:32,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:05:32,221 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 05:05:32,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:05:32,222 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 05:05:32,224 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 05:05:33,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:05:33,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:05:33,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 05:05:33,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:05:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 05:05:35,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:06:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 05:06:15,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:06:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989502944] [2023-12-25 05:06:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989502944] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:06:15,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:06:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-25 05:06:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445524328] [2023-12-25 05:06:15,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:06:15,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 05:06:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:06:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 05:06:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-12-25 05:06:15,066 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 05:06:31,137 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:06:51,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:01,627 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:07:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:23,112 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2023-12-25 05:07:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 05:07:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 52 [2023-12-25 05:07:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:23,182 INFO L225 Difference]: With dead ends: 93 [2023-12-25 05:07:23,182 INFO L226 Difference]: Without dead ends: 85 [2023-12-25 05:07:23,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 68.0s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2023-12-25 05:07:23,183 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:23,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 271 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 21.3s Time] [2023-12-25 05:07:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-25 05:07:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2023-12-25 05:07:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 05:07:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2023-12-25 05:07:23,205 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 52 [2023-12-25 05:07:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:23,205 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2023-12-25 05:07:23,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 05:07:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2023-12-25 05:07:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 05:07:23,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:23,206 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:23,240 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 05:07:23,406 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 05:07:23,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:23,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 252118104, now seen corresponding path program 2 times [2023-12-25 05:07:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046550390] [2023-12-25 05:07:23,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:07:23,407 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 05:07:23,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:23,408 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 05:07:23,410 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 05:07:24,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:07:24,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 05:07:24,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 05:07:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 05:07:26,526 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 05:07:26,526 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 05:07:26,527 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:07:26,593 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 05:07:26,728 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 05:07:26,731 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-12-25 05:07:26,733 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:07:26,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:07:26 BoogieIcfgContainer [2023-12-25 05:07:26,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:07:26,779 INFO L158 Benchmark]: Toolchain (without parser) took 224815.63ms. Allocated memory was 211.8MB in the beginning and 254.8MB in the end (delta: 43.0MB). Free memory was 147.0MB in the beginning and 159.7MB in the end (delta: -12.7MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2023-12-25 05:07:26,779 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 211.8MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:07:26,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.37ms. Allocated memory is still 211.8MB. Free memory was 146.7MB in the beginning and 135.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:07:26,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.78ms. Allocated memory is still 211.8MB. Free memory was 135.1MB in the beginning and 133.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:07:26,780 INFO L158 Benchmark]: Boogie Preprocessor took 30.57ms. Allocated memory is still 211.8MB. Free memory was 133.3MB in the beginning and 131.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:07:26,780 INFO L158 Benchmark]: RCFGBuilder took 520.70ms. Allocated memory was 211.8MB in the beginning and 254.8MB in the end (delta: 43.0MB). Free memory was 131.5MB in the beginning and 211.3MB in the end (delta: -79.8MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2023-12-25 05:07:26,781 INFO L158 Benchmark]: TraceAbstraction took 224012.75ms. Allocated memory is still 254.8MB. Free memory was 210.8MB in the beginning and 159.7MB in the end (delta: 51.1MB). Peak memory consumption was 51.7MB. Max. memory is 8.0GB. [2023-12-25 05:07:26,782 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.44ms. Allocated memory is still 211.8MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.37ms. Allocated memory is still 211.8MB. Free memory was 146.7MB in the beginning and 135.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.78ms. Allocated memory is still 211.8MB. Free memory was 135.1MB in the beginning and 133.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.57ms. Allocated memory is still 211.8MB. Free memory was 133.3MB in the beginning and 131.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 520.70ms. Allocated memory was 211.8MB in the beginning and 254.8MB in the end (delta: 43.0MB). Free memory was 131.5MB in the beginning and 211.3MB in the end (delta: -79.8MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * TraceAbstraction took 224012.75ms. Allocated memory is still 254.8MB. Free memory was 210.8MB in the beginning and 159.7MB in the end (delta: 51.1MB). Peak memory consumption was 51.7MB. 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 VAL [c=0, counter=0, k=6, x=0, y=0] [L28] EXPR counter++ VAL [c=0, counter=1, k=6, x=0, y=0] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [c=0, counter=1, k=6, x=0, y=0] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [c=1, counter=1, k=6, x=1, y=1] [L28] EXPR counter++ VAL [c=1, counter=2, k=6, x=1, y=1] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [c=1, counter=2, k=6, x=1, y=1] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [c=2, counter=2, k=6, x=33, y=2] [L28] EXPR counter++ VAL [c=2, counter=3, k=6, x=33, y=2] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [c=2, counter=3, k=6, x=33, y=2] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [c=3, counter=3, k=6, x=276, y=3] [L28] EXPR counter++ VAL [c=3, counter=4, k=6, x=276, y=3] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [c=3, counter=4, k=6, x=276, y=3] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [c=4, counter=4, k=6, x=1300, y=4] [L28] EXPR counter++ VAL [c=4, counter=5, k=6, x=1300, y=4] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [c=4, counter=5, k=6, x=1300, y=4] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [c=5, counter=5, k=6, x=4425, y=5] [L28] EXPR counter++ VAL [c=5, counter=6, k=6, x=4425, y=5] [L28] COND FALSE !(counter++<5) [L39] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L39] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [c=5, counter=6, k=6, x=4425, y=5] [L40] CALL __VERIFIER_assert(k*y == y*y) VAL [\old(cond)=0, counter=6] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=6] [L12] reach_error() VAL [\old(cond)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 223.9s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 123.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 61.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 55.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 750 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 499 IncrementalHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 155 mSDtfsCounter, 499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 113.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 91.6s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 2177 SizeOfPredicates, 15 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 267/450 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 proved your program to be incorrect! [2023-12-25 05:07:26,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...