/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/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:28:47,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:28:47,361 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-16 16:28:47,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:28:47,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:28:47,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:28:47,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:28:47,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:28:47,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:28:47,390 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:28:47,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:28:47,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:28:47,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:28:47,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:28:47,393 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:28:47,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:28:47,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:28:47,393 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:28:47,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:28:47,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:28:47,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:28:47,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:28:47,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:28:47,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:28:47,395 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:28:47,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:28:47,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:28:47,396 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:28:47,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:28:47,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:28:47,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:28:47,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:28:47,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:28:47,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:28:47,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:28:47,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:28:47,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:28:47,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:28:47,399 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:28:47,399 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-16 16:28:47,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:28:47,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:28:47,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:28:47,622 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:28:47,622 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:28:47,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2023-12-16 16:28:48,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:28:48,879 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:28:48,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2023-12-16 16:28:48,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782661f43/f7463c8ec7dc4766b36837454698a5cb/FLAG4cfc84044 [2023-12-16 16:28:48,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782661f43/f7463c8ec7dc4766b36837454698a5cb [2023-12-16 16:28:48,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:28:48,901 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:28:48,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:28:48,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:28:48,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:28:48,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:28:48" (1/1) ... [2023-12-16 16:28:48,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b765fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:48, skipping insertion in model container [2023-12-16 16:28:48,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:28:48" (1/1) ... [2023-12-16 16:28:48,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:28:49,039 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2023-12-16 16:28:49,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:28:49,081 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:28:49,090 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2023-12-16 16:28:49,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:28:49,121 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:28:49,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49 WrapperNode [2023-12-16 16:28:49,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:28:49,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:28:49,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:28:49,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:28:49,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,157 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2023-12-16 16:28:49,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:28:49,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:28:49,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:28:49,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:28:49,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:28:49,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:28:49,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:28:49,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:28:49,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:28:49,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (1/1) ... [2023-12-16 16:28:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:28:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:28:49,227 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-16 16:28:49,239 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-16 16:28:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:28:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:28:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:28:49,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:28:49,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:28:49,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:28:49,303 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:28:49,306 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:28:49,515 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:28:49,533 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:28:49,533 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:28:49,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:28:49 BoogieIcfgContainer [2023-12-16 16:28:49,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:28:49,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:28:49,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:28:49,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:28:49,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:28:48" (1/3) ... [2023-12-16 16:28:49,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d222729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:28:49, skipping insertion in model container [2023-12-16 16:28:49,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:49" (2/3) ... [2023-12-16 16:28:49,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d222729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:28:49, skipping insertion in model container [2023-12-16 16:28:49,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:28:49" (3/3) ... [2023-12-16 16:28:49,542 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-12-16 16:28:49,554 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:28:49,554 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:28:49,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:28:49,587 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;@657439b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:28:49,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:28:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 16:28:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:28:49,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:28:49,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:28:49,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:28:49,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:28:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 644946439, now seen corresponding path program 1 times [2023-12-16 16:28:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:28:49,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297835734] [2023-12-16 16:28:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:28:49,612 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-16 16:28:49,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:28:49,617 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-16 16:28:49,618 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-16 16:28:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:28:49,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:28:49,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:28:50,024 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-16 16:28:50,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:28:50,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:28:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297835734] [2023-12-16 16:28:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297835734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:28:50,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:28:50,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 16:28:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786251598] [2023-12-16 16:28:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:28:50,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:28:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:28:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:28:50,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:28:50,048 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-16 16:28:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:28:50,474 INFO L93 Difference]: Finished difference Result 122 states and 237 transitions. [2023-12-16 16:28:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:28:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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 12 [2023-12-16 16:28:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:28:50,481 INFO L225 Difference]: With dead ends: 122 [2023-12-16 16:28:50,481 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 16:28:50,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:28:50,488 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 123 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:28:50,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 233 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:28:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 16:28:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2023-12-16 16:28:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 16:28:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2023-12-16 16:28:50,536 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 12 [2023-12-16 16:28:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:28:50,536 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2023-12-16 16:28:50,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-16 16:28:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2023-12-16 16:28:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 16:28:50,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:28:50,538 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:28:50,543 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-16 16:28:50,739 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-16 16:28:50,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:28:50,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:28:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1092533038, now seen corresponding path program 1 times [2023-12-16 16:28:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:28:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203775597] [2023-12-16 16:28:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:28:50,742 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-16 16:28:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:28:50,744 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-16 16:28:50,745 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-16 16:28:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:28:50,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:28:50,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:28:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 16:28:50,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:28:50,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:28:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203775597] [2023-12-16 16:28:50,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203775597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:28:50,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:28:50,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:28:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712831636] [2023-12-16 16:28:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:28:50,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:28:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:28:50,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:28:50,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:28:50,837 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (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-16 16:28:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:28:50,879 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2023-12-16 16:28:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:28:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (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 46 [2023-12-16 16:28:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:28:50,891 INFO L225 Difference]: With dead ends: 91 [2023-12-16 16:28:50,891 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 16:28:50,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-16 16:28:50,895 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:28:50,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:28:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 16:28:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-16 16:28:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-16 16:28:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2023-12-16 16:28:50,914 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 46 [2023-12-16 16:28:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:28:50,915 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2023-12-16 16:28:50,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (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-16 16:28:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2023-12-16 16:28:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 16:28:50,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:28:50,919 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:28:50,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:28:51,123 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-16 16:28:51,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:28:51,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:28:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1294632752, now seen corresponding path program 1 times [2023-12-16 16:28:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:28:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726575170] [2023-12-16 16:28:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:28:51,125 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-16 16:28:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:28:51,127 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-16 16:28:51,132 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-16 16:28:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:28:51,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 16:28:51,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:28:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 16:28:51,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:28:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-16 16:28:52,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:28:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726575170] [2023-12-16 16:28:52,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726575170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:28:52,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:28:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2023-12-16 16:28:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232322702] [2023-12-16 16:28:52,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:28:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:28:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:28:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:28:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:28:52,103 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-16 16:28:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:28:52,874 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2023-12-16 16:28:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:28:52,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2023-12-16 16:28:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:28:52,876 INFO L225 Difference]: With dead ends: 66 [2023-12-16 16:28:52,876 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 16:28:52,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:28:52,877 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:28:52,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 209 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:28:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 16:28:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-12-16 16:28:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 16:28:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2023-12-16 16:28:52,900 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 47 [2023-12-16 16:28:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:28:52,900 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2023-12-16 16:28:52,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-16 16:28:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2023-12-16 16:28:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 16:28:52,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:28:52,901 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:28:52,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:28:53,104 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-16 16:28:53,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:28:53,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:28:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash 939016302, now seen corresponding path program 1 times [2023-12-16 16:28:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:28:53,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666928550] [2023-12-16 16:28:53,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:28:53,109 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-16 16:28:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:28:53,113 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-16 16:28:53,118 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-16 16:28:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:28:53,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:28:53,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:28:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 16:28:53,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:28:53,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:28:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666928550] [2023-12-16 16:28:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666928550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:28:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:28:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 16:28:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707789429] [2023-12-16 16:28:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:28:53,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:28:53,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:28:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:28:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:28:53,383 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 16:28:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:28:53,535 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2023-12-16 16:28:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:28:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 82 [2023-12-16 16:28:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:28:53,537 INFO L225 Difference]: With dead ends: 84 [2023-12-16 16:28:53,537 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 16:28:53,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:28:53,538 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 19 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:28:53,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 322 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:28:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 16:28:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2023-12-16 16:28:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.125) internal successors, (45), 45 states have internal predecessors, (45), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:28:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2023-12-16 16:28:53,550 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 82 [2023-12-16 16:28:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:28:53,550 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2023-12-16 16:28:53,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 16:28:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2023-12-16 16:28:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 16:28:53,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:28:53,552 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:28:53,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:28:53,752 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-16 16:28:53,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:28:53,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:28:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1183022513, now seen corresponding path program 1 times [2023-12-16 16:28:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:28:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385533888] [2023-12-16 16:28:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:28:53,753 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-16 16:28:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:28:53,777 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-16 16:28:53,795 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-16 16:28:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:28:53,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:28:53,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:28:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 71 proven. 22 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 16:28:54,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:28:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 77 proven. 16 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 16:28:54,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:28:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385533888] [2023-12-16 16:28:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385533888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:28:54,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:28:54,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2023-12-16 16:28:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541129878] [2023-12-16 16:28:54,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:28:54,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:28:54,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:28:54,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:28:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:28:54,459 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 10 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-16 16:28:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:28:54,935 INFO L93 Difference]: Finished difference Result 104 states and 143 transitions. [2023-12-16 16:28:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:28:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 10 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) Word has length 116 [2023-12-16 16:28:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:28:54,937 INFO L225 Difference]: With dead ends: 104 [2023-12-16 16:28:54,937 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 16:28:54,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2023-12-16 16:28:54,938 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:28:54,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 460 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:28:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 16:28:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2023-12-16 16:28:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 16:28:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2023-12-16 16:28:54,962 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 116 [2023-12-16 16:28:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:28:54,964 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2023-12-16 16:28:54,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 10 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-16 16:28:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2023-12-16 16:28:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-16 16:28:54,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:28:54,966 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:28:54,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:28:55,173 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-16 16:28:55,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:28:55,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:28:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 144027372, now seen corresponding path program 2 times [2023-12-16 16:28:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:28:55,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854406273] [2023-12-16 16:28:55,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:28:55,174 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-16 16:28:55,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:28:55,176 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-16 16:28:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:28:55,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:28:55,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:28:55,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:28:55,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:28:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 50 proven. 24 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-16 16:28:55,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:28:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 50 proven. 24 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-16 16:28:55,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:28:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854406273] [2023-12-16 16:28:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854406273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:28:55,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:28:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:28:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212327296] [2023-12-16 16:28:55,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:28:55,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:28:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:28:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:28:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:28:55,461 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-12-16 16:28:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:28:55,738 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2023-12-16 16:28:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:28:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 155 [2023-12-16 16:28:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:28:55,740 INFO L225 Difference]: With dead ends: 139 [2023-12-16 16:28:55,740 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:28:55,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:28:55,741 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 47 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:28:55,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 738 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:28:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:28:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:28:55,742 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-16 16:28:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:28:55,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2023-12-16 16:28:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:28:55,742 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:28:55,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-12-16 16:28:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:28:55,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:28:55,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:28:55,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 (7)] Ended with exit code 0 [2023-12-16 16:28:55,949 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-16 16:28:55,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:28:58,268 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-12-16 16:28:58,269 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-12-16 16:28:58,269 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-12-16 16:28:58,269 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-12-16 16:28:58,269 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-12-16 16:28:58,269 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-12-16 16:28:58,269 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32))) (.cse1 (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32))) (.cse2 (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32))) (.cse3 (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) .cse3 (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) (and .cse0 .cse1 .cse2 (not (= (_ bv0 32) |ULTIMATE.start_main_~cp~0#1|)) .cse3 (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)))) [2023-12-16 16:28:58,270 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,270 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,270 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2023-12-16 16:28:58,270 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2023-12-16 16:28:58,270 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:28:58,270 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,270 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,270 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,271 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,271 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 47 52) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,271 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (let ((.cse0 (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32))) (.cse1 (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32))) (.cse2 (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32))) (.cse3 (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) .cse3 (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) (and .cse0 .cse1 .cse2 (not (= (_ bv0 32) |ULTIMATE.start_main_~cp~0#1|)) .cse3 (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)))) [2023-12-16 16:28:58,271 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,271 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,271 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,271 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-12-16 16:28:58,271 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-16 16:28:58,272 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,272 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-12-16 16:28:58,272 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 65 77) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,272 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2023-12-16 16:28:58,272 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,272 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,272 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-12-16 16:28:58,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:28:58,272 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,273 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,273 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 32)) |ULTIMATE.start_main_~tokenlen~0#1|) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 32)) |ULTIMATE.start_main_~tokenlen~0#1|) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-12-16 16:28:58,273 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-12-16 16:28:58,274 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-12-16 16:28:58,274 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 16:28:58,274 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 16:28:58,274 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-12-16 16:28:58,276 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-16 16:28:58,277 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:28:58,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:28:58 BoogieIcfgContainer [2023-12-16 16:28:58,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:28:58,293 INFO L158 Benchmark]: Toolchain (without parser) took 9391.95ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 177.9MB in the beginning and 153.4MB in the end (delta: 24.6MB). Peak memory consumption was 139.9MB. Max. memory is 8.0GB. [2023-12-16 16:28:58,294 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:28:58,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.26ms. Allocated memory is still 229.6MB. Free memory was 177.4MB in the beginning and 165.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:28:58,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.19ms. Allocated memory is still 229.6MB. Free memory was 165.4MB in the beginning and 163.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:28:58,294 INFO L158 Benchmark]: Boogie Preprocessor took 34.48ms. Allocated memory is still 229.6MB. Free memory was 163.8MB in the beginning and 161.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:28:58,294 INFO L158 Benchmark]: RCFGBuilder took 341.45ms. Allocated memory is still 229.6MB. Free memory was 161.7MB in the beginning and 147.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 16:28:58,295 INFO L158 Benchmark]: TraceAbstraction took 8756.82ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 146.5MB in the beginning and 153.4MB in the end (delta: -6.9MB). Peak memory consumption was 108.5MB. Max. memory is 8.0GB. [2023-12-16 16:28:58,296 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.11ms. Allocated memory is still 190.8MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.26ms. Allocated memory is still 229.6MB. Free memory was 177.4MB in the beginning and 165.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.19ms. Allocated memory is still 229.6MB. Free memory was 165.4MB in the beginning and 163.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.48ms. Allocated memory is still 229.6MB. Free memory was 163.8MB in the beginning and 161.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 341.45ms. Allocated memory is still 229.6MB. Free memory was 161.7MB in the beginning and 147.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8756.82ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 146.5MB in the beginning and 153.4MB in the end (delta: -6.9MB). Peak memory consumption was 108.5MB. 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: 19]: 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 2078 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1716 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1269 IncrementalHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 362 mSDtfsCounter, 1269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 790 GetRequests, 712 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, InterpolantAutomatonStates: 62, 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, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 113 PreInvPairs, 186 NumberOfFragments, 816 HoareAnnotationTreeSize, 113 FormulaSimplifications, 7493 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 21 FormulaSimplificationsInter, 6660 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 767 ConstructedInterpolants, 0 QuantifiedInterpolants, 2017 SizeOfPredicates, 11 NumberOfNonLiveVariables, 709 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 4234/4360 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: 47]: Loop Invariant Derived loop invariant: (((((((((urilen <= 1000000) && (urilen > 0)) && (scheme <= 1000000)) && (0 <= ((-1 + cp) % 4294967296))) && (scheme >= 0)) && (cp >= 0)) && (tokenlen > 0)) && !((((-1 + urilen) % 4294967296) < cp))) && (tokenlen <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((c < tokenlen) && (urilen <= 1000000)) && (0 <= c)) && (urilen > 0)) && (scheme <= 1000000)) && (0 <= ((-1 + cp) % 4294967296))) && (scheme >= 0)) && (cp >= 0)) && !((((-1 + urilen) % 4294967296) < cp))) && (tokenlen <= 1000000)) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:28:58,321 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...