/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/hard2_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:36:30,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:36:30,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 03:36:30,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:36:30,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:36:30,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:36:30,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:36:30,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:36:30,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:36:30,332 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:36:30,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:36:30,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:36:30,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:36:30,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:36:30,334 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:36:30,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:36:30,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:36:30,335 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:36:30,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:36:30,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:36:30,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:36:30,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:36:30,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:36:30,336 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:36:30,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:36:30,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:36:30,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:36:30,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:36:30,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:36:30,338 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:36:30,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:36:30,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:36:30,339 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:36:30,339 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 03:36:30,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:36:30,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:36:30,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:36:30,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:36:30,569 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:36:30,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c [2023-12-25 03:36:31,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:36:31,825 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:36:31,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound1.c [2023-12-25 03:36:31,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe24ddc97/21a83720c4cd4b6fbf17f3cb794d775f/FLAGbf29712f5 [2023-12-25 03:36:31,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe24ddc97/21a83720c4cd4b6fbf17f3cb794d775f [2023-12-25 03:36:31,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:36:31,846 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:36:31,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:36:31,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:36:31,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:36:31,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:36:31" (1/1) ... [2023-12-25 03:36:31,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c2de11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:31, skipping insertion in model container [2023-12-25 03:36:31,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:36:31" (1/1) ... [2023-12-25 03:36:31,871 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:36:31,987 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/hard2_valuebound1.c[526,539] [2023-12-25 03:36:32,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:36:32,011 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:36:32,022 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/hard2_valuebound1.c[526,539] [2023-12-25 03:36:32,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:36:32,037 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:36:32,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32 WrapperNode [2023-12-25 03:36:32,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:36:32,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:36:32,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:36:32,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:36:32,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,065 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2023-12-25 03:36:32,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:36:32,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:36:32,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:36:32,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:36:32,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,084 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-25 03:36:32,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:36:32,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:36:32,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:36:32,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:36:32,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (1/1) ... [2023-12-25 03:36:32,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:36:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:36:32,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 03:36:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 03:36:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:36:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:36:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 03:36:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:36:32,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:36:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:36:32,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:36:32,295 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:36:32,297 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:36:32,484 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:36:32,503 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:36:32,503 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:36:32,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:36:32 BoogieIcfgContainer [2023-12-25 03:36:32,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:36:32,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:36:32,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:36:32,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:36:32,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:36:31" (1/3) ... [2023-12-25 03:36:32,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efeb8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:36:32, skipping insertion in model container [2023-12-25 03:36:32,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:32" (2/3) ... [2023-12-25 03:36:32,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efeb8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:36:32, skipping insertion in model container [2023-12-25 03:36:32,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:36:32" (3/3) ... [2023-12-25 03:36:32,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.c [2023-12-25 03:36:32,522 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:36:32,522 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:36:32,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:36:32,559 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;@ecc2aa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:36:32,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:36:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 03:36:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 03:36:32,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:32,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:32,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:32,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1830609328, now seen corresponding path program 1 times [2023-12-25 03:36:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429515166] [2023-12-25 03:36:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:32,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:32,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:32,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:32,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 03:36:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:32,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:36:32,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:32,641 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 03:36:32,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:32,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429515166] [2023-12-25 03:36:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429515166] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:36:32,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703341932] [2023-12-25 03:36:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:36:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:36:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:36:32,666 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:36:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:32,697 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2023-12-25 03:36:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:36:32,699 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 03:36:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:32,704 INFO L225 Difference]: With dead ends: 44 [2023-12-25 03:36:32,704 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 03:36:32,707 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 03:36:32,711 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:32,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:36:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 03:36:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 03:36:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:36:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2023-12-25 03:36:32,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2023-12-25 03:36:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:32,747 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-12-25 03:36:32,747 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 03:36:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2023-12-25 03:36:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 03:36:32,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:32,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:32,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 03:36:32,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:32,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:32,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash -55601966, now seen corresponding path program 1 times [2023-12-25 03:36:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867628752] [2023-12-25 03:36:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:32,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:32,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 03:36:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:33,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:36:33,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:33,110 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 03:36:33,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:33,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867628752] [2023-12-25 03:36:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867628752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:33,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:36:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512276361] [2023-12-25 03:36:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:33,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:36:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:33,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:36:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:36:33,113 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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 03:36:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:33,203 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-12-25 03:36:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:33,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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 03:36:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:33,204 INFO L225 Difference]: With dead ends: 34 [2023-12-25 03:36:33,204 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 03:36:33,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:36:33,205 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:33,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:36:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 03:36:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-25 03:36:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:36:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-25 03:36:33,212 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 8 [2023-12-25 03:36:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:33,213 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-25 03:36:33,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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 03:36:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-25 03:36:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-25 03:36:33,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:33,213 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:33,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 03:36:33,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:33,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:33,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104181, now seen corresponding path program 1 times [2023-12-25 03:36:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342241335] [2023-12-25 03:36:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:33,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:33,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:36:33,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 03:36:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:36:33,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:33,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342241335] [2023-12-25 03:36:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342241335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:33,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:33,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:36:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654502043] [2023-12-25 03:36:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:33,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:36:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:36:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:36:33,499 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:36:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:33,618 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-25 03:36:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-25 03:36:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:33,619 INFO L225 Difference]: With dead ends: 38 [2023-12-25 03:36:33,619 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 03:36:33,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:36:33,620 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:33,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:36:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 03:36:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2023-12-25 03:36:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:36:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-25 03:36:33,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 13 [2023-12-25 03:36:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:33,626 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-25 03:36:33,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 03:36:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-25 03:36:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 03:36:33,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:33,627 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:33,631 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 03:36:33,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:33,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:33,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1972613170, now seen corresponding path program 1 times [2023-12-25 03:36:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:33,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134568842] [2023-12-25 03:36:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:33,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:33,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 03:36:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:33,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 03:36:33,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 03:36:33,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:33,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134568842] [2023-12-25 03:36:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134568842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:33,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:33,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:36:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812474651] [2023-12-25 03:36:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:33,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:36:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:33,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:36:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:36:33,956 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:36:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:34,138 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2023-12-25 03:36:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 03:36:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:34,139 INFO L225 Difference]: With dead ends: 57 [2023-12-25 03:36:34,139 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:36:34,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:36:34,140 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:34,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:36:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:36:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-25 03:36:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:36:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2023-12-25 03:36:34,148 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 18 [2023-12-25 03:36:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:34,148 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2023-12-25 03:36:34,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:36:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2023-12-25 03:36:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 03:36:34,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:34,149 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:34,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 03:36:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:34,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:34,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1810344840, now seen corresponding path program 1 times [2023-12-25 03:36:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918201699] [2023-12-25 03:36:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:34,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:34,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:34,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:36:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:34,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:36:34,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:36:34,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:34,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918201699] [2023-12-25 03:36:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918201699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 03:36:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261198556] [2023-12-25 03:36:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 03:36:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 03:36:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-25 03:36:34,664 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:36:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:34,956 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-12-25 03:36:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 03:36:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-25 03:36:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:34,957 INFO L225 Difference]: With dead ends: 57 [2023-12-25 03:36:34,957 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 03:36:34,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:36:34,958 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:34,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:36:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 03:36:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-25 03:36:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:36:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-25 03:36:34,965 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 25 [2023-12-25 03:36:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:34,965 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-25 03:36:34,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:36:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-25 03:36:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 03:36:34,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:34,966 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:34,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 03:36:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:35,167 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:35,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash -447891575, now seen corresponding path program 1 times [2023-12-25 03:36:35,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:35,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216222682] [2023-12-25 03:36:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:35,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:35,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:35,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 03:36:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:35,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:36:35,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:36:35,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:36:35,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:35,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216222682] [2023-12-25 03:36:35,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216222682] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:36:35,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:36:35,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-25 03:36:35,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098402256] [2023-12-25 03:36:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:36:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:36:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 03:36:35,883 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:36:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:36,279 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-12-25 03:36:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:36:36,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-25 03:36:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:36,280 INFO L225 Difference]: With dead ends: 58 [2023-12-25 03:36:36,280 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 03:36:36,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:36:36,281 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:36,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 03:36:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 03:36:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2023-12-25 03:36:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:36:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-12-25 03:36:36,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 35 [2023-12-25 03:36:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:36,289 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-12-25 03:36:36,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:36:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-12-25 03:36:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 03:36:36,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:36,290 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:36,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 03:36:36,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:36,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:36,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1423879489, now seen corresponding path program 1 times [2023-12-25 03:36:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629176863] [2023-12-25 03:36:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:36,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:36,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:36,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:36,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 03:36:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:36,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:36:36,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 03:36:36,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 03:36:37,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629176863] [2023-12-25 03:36:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629176863] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:36:37,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:36:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-25 03:36:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133848447] [2023-12-25 03:36:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:37,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:36:37,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:36:37,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:36:37,778 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 03:36:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:38,500 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-12-25 03:36:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:36:38,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2023-12-25 03:36:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:38,508 INFO L225 Difference]: With dead ends: 72 [2023-12-25 03:36:38,508 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 03:36:38,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:36:38,509 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:38,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 79 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 03:36:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 03:36:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2023-12-25 03:36:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 03:36:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-12-25 03:36:38,520 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 42 [2023-12-25 03:36:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:38,520 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-12-25 03:36:38,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 03:36:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-12-25 03:36:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 03:36:38,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:38,521 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:38,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 03:36:38,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:38,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:38,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:38,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2120570403, now seen corresponding path program 1 times [2023-12-25 03:36:38,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:38,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057910240] [2023-12-25 03:36:38,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:38,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:38,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 03:36:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:38,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 03:36:38,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:36:38,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:38,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:38,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057910240] [2023-12-25 03:36:38,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057910240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:36:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897163638] [2023-12-25 03:36:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 03:36:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 03:36:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:36:38,909 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 03:36:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:39,403 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2023-12-25 03:36:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 03:36:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2023-12-25 03:36:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:39,404 INFO L225 Difference]: With dead ends: 71 [2023-12-25 03:36:39,404 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 03:36:39,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:36:39,405 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:39,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 03:36:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 03:36:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-12-25 03:36:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 03:36:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2023-12-25 03:36:39,415 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 53 [2023-12-25 03:36:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:39,416 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2023-12-25 03:36:39,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 03:36:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2023-12-25 03:36:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 03:36:39,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:39,417 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:39,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:39,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:39,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:39,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1460518785, now seen corresponding path program 1 times [2023-12-25 03:36:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210041473] [2023-12-25 03:36:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:39,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:39,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:39,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:39,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 03:36:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:39,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 03:36:39,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:36:40,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:36:47,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210041473] [2023-12-25 03:36:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210041473] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:36:47,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:36:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 03:36:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584308808] [2023-12-25 03:36:47,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:36:47,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 03:36:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 03:36:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 03:36:47,139 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 6 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 03:36:55,002 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 37 DAG size of output: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:36:57,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:59,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:03,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:07,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:26,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:29,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:33,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:44,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:48,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:53,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:05,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:11,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:38:25,071 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2023-12-25 03:38:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 03:38:25,097 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 6 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 55 [2023-12-25 03:38:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:38:25,098 INFO L225 Difference]: With dead ends: 145 [2023-12-25 03:38:25,098 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 03:38:25,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=147, Invalid=502, Unknown=1, NotChecked=0, Total=650 [2023-12-25 03:38:25,099 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 71 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:38:25,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 199 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 240 Invalid, 8 Unknown, 0 Unchecked, 53.1s Time] [2023-12-25 03:38:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 03:38:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2023-12-25 03:38:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 03:38:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2023-12-25 03:38:25,115 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 55 [2023-12-25 03:38:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:38:25,115 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2023-12-25 03:38:25,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 6 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 03:38:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2023-12-25 03:38:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 03:38:25,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:38:25,116 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:38:25,122 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 (10)] Ended with exit code 0 [2023-12-25 03:38:25,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:38:25,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:38:25,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:38:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash -814878683, now seen corresponding path program 1 times [2023-12-25 03:38:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:38:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948669942] [2023-12-25 03:38:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:38:25,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:38:25,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:38:25,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:38:25,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 03:38:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:38:25,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 03:38:25,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:38:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 03:38:25,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:38:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 03:38:34,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:38:34,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948669942] [2023-12-25 03:38:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948669942] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:38:34,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:38:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 03:38:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548453812] [2023-12-25 03:38:34,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:38:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 03:38:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:38:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 03:38:34,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 03:38:34,828 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-25 03:38:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:38:37,010 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-12-25 03:38:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 03:38:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 66 [2023-12-25 03:38:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:38:37,011 INFO L225 Difference]: With dead ends: 101 [2023-12-25 03:38:37,011 INFO L226 Difference]: Without dead ends: 64 [2023-12-25 03:38:37,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-25 03:38:37,012 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:38:37,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 201 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 03:38:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-25 03:38:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-25 03:38:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:38:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2023-12-25 03:38:37,024 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 66 [2023-12-25 03:38:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:38:37,028 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2023-12-25 03:38:37,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-25 03:38:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2023-12-25 03:38:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 03:38:37,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:38:37,033 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:38:37,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 03:38:37,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:38:37,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:38:37,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:38:37,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1399001704, now seen corresponding path program 1 times [2023-12-25 03:38:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:38:37,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721150744] [2023-12-25 03:38:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:38:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:38:37,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:38:37,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:38:37,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 03:38:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:38:37,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 03:38:37,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:38:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 03:38:37,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:38:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 03:38:38,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:38:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721150744] [2023-12-25 03:38:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721150744] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:38:38,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:38:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2023-12-25 03:38:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032380351] [2023-12-25 03:38:38,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:38:38,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 03:38:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:38:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 03:38:38,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:38:38,785 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 03:38:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:38:39,341 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2023-12-25 03:38:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:38:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 71 [2023-12-25 03:38:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:38:39,341 INFO L225 Difference]: With dead ends: 64 [2023-12-25 03:38:39,341 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 03:38:39,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:38:39,343 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:38:39,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 03:38:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 03:38:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 03:38:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:38:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 03:38:39,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2023-12-25 03:38:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:38:39,344 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 03:38:39,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 03:38:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 03:38:39,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 03:38:39,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:38:39,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 03:38:39,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:38:39,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 03:38:40,707 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-12-25 03:38:40,707 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse6 (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (or (let ((.cse2 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~p~0#1|)) (= .cse2 |ULTIMATE.start_main_~A~0#1|) (bvsge .cse2 (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse3)) (and .cse0 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse6 (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 .cse1 .cse4 .cse5 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) (not .cse6) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,707 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:38:40,707 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32)))) (or (let ((.cse2 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~p~0#1|)) (= .cse2 |ULTIMATE.start_main_~A~0#1|) (bvsge .cse2 (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,707 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse1 .cse2 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) .cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,707 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse6 (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (or (let ((.cse2 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~p~0#1|)) (= .cse2 |ULTIMATE.start_main_~A~0#1|) (bvsge .cse2 (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse3)) (and .cse0 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse6 (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 .cse1 .cse4 .cse5 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) (not .cse6) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse6 (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (or (let ((.cse2 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~p~0#1|)) (= .cse2 |ULTIMATE.start_main_~A~0#1|) (bvsge .cse2 (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse3)) (and .cse0 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse6 (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 .cse1 .cse4 .cse5 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) (not .cse6) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse1 .cse2 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) .cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse1 .cse2 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) .cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,708 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvsle |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvsge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) .cse3) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse1 .cse2 (bvsge |ULTIMATE.start_main_~A~0#1| (_ bv0 32)) .cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:38:40,708 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-25 03:38:40,709 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-25 03:38:40,711 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:38:40,712 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:38:40,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:38:40 BoogieIcfgContainer [2023-12-25 03:38:40,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:38:40,720 INFO L158 Benchmark]: Toolchain (without parser) took 128873.68ms. Allocated memory was 313.5MB in the beginning and 376.4MB in the end (delta: 62.9MB). Free memory was 263.5MB in the beginning and 310.0MB in the end (delta: -46.5MB). Peak memory consumption was 200.3MB. Max. memory is 8.0GB. [2023-12-25 03:38:40,720 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:38:40,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.90ms. Allocated memory is still 313.5MB. Free memory was 263.5MB in the beginning and 251.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:38:40,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.63ms. Allocated memory is still 313.5MB. Free memory was 251.8MB in the beginning and 250.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:38:40,721 INFO L158 Benchmark]: Boogie Preprocessor took 26.12ms. Allocated memory is still 313.5MB. Free memory was 250.3MB in the beginning and 248.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:38:40,721 INFO L158 Benchmark]: RCFGBuilder took 411.31ms. Allocated memory is still 313.5MB. Free memory was 248.5MB in the beginning and 234.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 03:38:40,721 INFO L158 Benchmark]: TraceAbstraction took 128214.35ms. Allocated memory was 313.5MB in the beginning and 376.4MB in the end (delta: 62.9MB). Free memory was 234.2MB in the beginning and 310.0MB in the end (delta: -75.8MB). Peak memory consumption was 171.0MB. Max. memory is 8.0GB. [2023-12-25 03:38:40,722 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.90ms. Allocated memory is still 313.5MB. Free memory was 263.5MB in the beginning and 251.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.63ms. Allocated memory is still 313.5MB. Free memory was 251.8MB in the beginning and 250.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.12ms. Allocated memory is still 313.5MB. Free memory was 250.3MB in the beginning and 248.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 411.31ms. Allocated memory is still 313.5MB. Free memory was 248.5MB in the beginning and 234.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 128214.35ms. Allocated memory was 313.5MB in the beginning and 376.4MB in the end (delta: 62.9MB). Free memory was 234.2MB in the beginning and 310.0MB in the end (delta: -75.8MB). Peak memory consumption was 171.0MB. 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 128.2s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 103.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 57.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 1202 SdHoareTripleChecker+Invalid, 55.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 921 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 281 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 56.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=9, InterpolantAutomatonStates: 79, 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, 11 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 61 PreInvPairs, 82 NumberOfFragments, 465 HoareAnnotationTreeSize, 61 FormulaSimplifications, 1800 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FormulaSimplificationsInter, 116 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 647 ConstructedInterpolants, 9 QuantifiedInterpolants, 3041 SizeOfPredicates, 23 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 1554/1613 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((((B == 1) && (d == 1)) && (A == ((r + p) % 4294967296))) && (((r + 1) % 4294967296) == A)) && (((r + 1) % 4294967296) >= 1)) && (q == 1)) && (A <= 1)) || (((((((B == 1) && (r == A)) && (q == 0)) && (p == 2)) && (r >= 1)) && (d == 2)) && (A <= 1))) || (((((((B == 1) && (d == 1)) && (r == A)) && (q == 0)) && (A >= 0)) && !((r >= 1))) && (p == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((B == 1) && (r == A)) && (q == 0)) && (p == 2)) && (r >= 1)) && (d == 2)) && (A <= 1)) || (((((((B == 1) && (d == 1)) && (r == A)) && (q == 0)) && (A >= 0)) && (A <= 1)) && (p == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-25 03:38:40,755 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...