/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:58:32,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:58:32,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:58:32,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:58:32,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:58:32,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:58:32,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:58:32,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:58:32,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:58:32,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:58:32,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:58:32,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:58:32,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:58:32,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:58:32,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:58:32,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:58:32,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:58:32,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:58:32,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:58:32,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:58:32,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:58:32,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:58:32,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:58:32,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:58:32,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:58:32,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:58:32,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:58:32,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:58:32,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:58:32,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:58:32,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:58:32,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:58:32,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:58:32,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:58:32,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:58:32,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:58:32,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:58:32,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:58:32,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:58:32,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:58:32,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:58:32,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:58:32,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:58:32,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:58:32,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:58:32,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:58:32,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:58:32,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:58:32,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:58:32,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:58:32,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:32,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:58:32,398 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 20:58:32,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:58:32,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:58:32,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:58:32,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:58:32,613 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:58:32,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-01-31 20:58:32,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e193fbdf/368b372c82de4508bc40939bbc3a6994/FLAG7cd5b4b01 [2022-01-31 20:58:33,016 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:58:33,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-01-31 20:58:33,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e193fbdf/368b372c82de4508bc40939bbc3a6994/FLAG7cd5b4b01 [2022-01-31 20:58:33,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e193fbdf/368b372c82de4508bc40939bbc3a6994 [2022-01-31 20:58:33,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:58:33,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:58:33,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:33,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:58:33,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:58:33,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402a1bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33, skipping insertion in model container [2022-01-31 20:58:33,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:58:33,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:58:33,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-01-31 20:58:33,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:33,586 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:58:33,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-01-31 20:58:33,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:33,637 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:58:33,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33 WrapperNode [2022-01-31 20:58:33,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:33,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:58:33,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:58:33,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:58:33,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:58:33,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:58:33,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:58:33,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:58:33,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (1/1) ... [2022-01-31 20:58:33,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:33,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:58:33,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 20:58:33,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 20:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:58:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:58:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:58:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:58:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:58:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:58:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:58:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:58:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:58:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:58:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:58:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:58:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:58:33,785 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:58:33,786 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:58:33,903 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:58:33,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:58:33,907 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 20:58:33,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:33 BoogieIcfgContainer [2022-01-31 20:58:33,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:58:33,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:58:33,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:58:33,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:58:33,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:58:33" (1/3) ... [2022-01-31 20:58:33,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5d37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:33, skipping insertion in model container [2022-01-31 20:58:33,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:33" (2/3) ... [2022-01-31 20:58:33,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5d37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:33, skipping insertion in model container [2022-01-31 20:58:33,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:33" (3/3) ... [2022-01-31 20:58:33,927 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-01-31 20:58:33,930 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:58:33,930 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:58:33,973 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:58:33,977 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:58:33,978 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:58:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 20:58:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:58:34,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:34,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:34,006 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:34,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2022-01-31 20:58:34,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:34,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980890695] [2022-01-31 20:58:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:34,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:34,056 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:34,127 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:34,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980890695] [2022-01-31 20:58:34,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1980890695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:34,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:34,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 20:58:34,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096280486] [2022-01-31 20:58:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:34,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 20:58:34,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:34,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 20:58:34,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 20:58:34,152 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:34,217 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-01-31 20:58:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 20:58:34,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 20:58:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:34,223 INFO L225 Difference]: With dead ends: 62 [2022-01-31 20:58:34,224 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 20:58:34,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 20:58:34,228 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:34,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 20:58:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 20:58:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-31 20:58:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 20:58:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-01-31 20:58:34,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-01-31 20:58:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:34,256 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-01-31 20:58:34,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-01-31 20:58:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 20:58:34,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:34,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:34,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:58:34,258 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2022-01-31 20:58:34,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:34,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1126113105] [2022-01-31 20:58:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:34,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:34,261 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:34,339 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:34,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1126113105] [2022-01-31 20:58:34,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1126113105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:34,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:34,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:34,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728718235] [2022-01-31 20:58:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:34,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:34,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:58:34,341 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:34,440 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-01-31 20:58:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:58:34,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 20:58:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:34,442 INFO L225 Difference]: With dead ends: 36 [2022-01-31 20:58:34,442 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 20:58:34,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:34,443 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:34,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 20:58:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-31 20:58:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 20:58:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-01-31 20:58:34,452 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-01-31 20:58:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:34,453 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-01-31 20:58:34,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-01-31 20:58:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 20:58:34,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:34,454 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:34,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:58:34,454 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2022-01-31 20:58:34,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:34,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188478896] [2022-01-31 20:58:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:34,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:34,457 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:34,552 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188478896] [2022-01-31 20:58:34,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1188478896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:34,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:34,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:34,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61473490] [2022-01-31 20:58:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:34,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:34,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:34,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:34,554 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:34,731 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-01-31 20:58:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:58:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-01-31 20:58:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:34,735 INFO L225 Difference]: With dead ends: 49 [2022-01-31 20:58:34,735 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 20:58:34,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:58:34,741 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:34,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 20:58:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-01-31 20:58:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 20:58:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-01-31 20:58:34,761 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-01-31 20:58:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:34,761 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-01-31 20:58:34,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-01-31 20:58:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 20:58:34,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:34,762 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:34,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:58:34,763 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2022-01-31 20:58:34,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:34,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [538601023] [2022-01-31 20:58:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:34,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:34,765 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:58:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:58:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:34,863 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:34,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [538601023] [2022-01-31 20:58:34,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [538601023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:34,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:34,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:34,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716856457] [2022-01-31 20:58:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:34,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:34,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:34,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:34,866 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 20:58:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:35,021 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-01-31 20:58:35,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:58:35,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-01-31 20:58:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:35,023 INFO L225 Difference]: With dead ends: 56 [2022-01-31 20:58:35,023 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 20:58:35,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:58:35,024 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:35,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 20:58:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-01-31 20:58:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 20:58:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-01-31 20:58:35,032 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-01-31 20:58:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:35,032 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-01-31 20:58:35,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 20:58:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-01-31 20:58:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 20:58:35,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:35,033 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:35,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:58:35,033 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2022-01-31 20:58:35,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:35,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323460079] [2022-01-31 20:58:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:35,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:35,036 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 20:58:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 20:58:35,095 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323460079] [2022-01-31 20:58:35,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [323460079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:35,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:35,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:58:35,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826461151] [2022-01-31 20:58:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:35,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:58:35,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:58:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:58:35,097 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 20:58:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:35,273 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-01-31 20:58:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-01-31 20:58:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:35,274 INFO L225 Difference]: With dead ends: 75 [2022-01-31 20:58:35,274 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 20:58:35,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:58:35,275 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:35,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 20:58:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-01-31 20:58:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 20:58:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-01-31 20:58:35,285 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-01-31 20:58:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:35,285 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-01-31 20:58:35,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 20:58:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-01-31 20:58:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 20:58:35,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:35,286 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:35,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:58:35,286 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2022-01-31 20:58:35,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:35,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571258417] [2022-01-31 20:58:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:35,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:35,288 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:58:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:58:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 20:58:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:35,349 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571258417] [2022-01-31 20:58:35,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1571258417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:35,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:35,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:35,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866088932] [2022-01-31 20:58:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:35,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:35,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:35,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:58:35,350 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 20:58:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:35,558 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-01-31 20:58:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:58:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-01-31 20:58:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:35,559 INFO L225 Difference]: With dead ends: 77 [2022-01-31 20:58:35,559 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 20:58:35,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:58:35,560 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:35,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 56 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 20:58:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-01-31 20:58:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 20:58:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-01-31 20:58:35,570 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-01-31 20:58:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:35,570 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-01-31 20:58:35,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 20:58:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-01-31 20:58:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 20:58:35,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:35,571 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2022-01-31 20:58:35,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:58:35,571 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2022-01-31 20:58:35,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:35,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970976594] [2022-01-31 20:58:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:35,777 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:35,778 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:35,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:58:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:58:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 20:58:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 20:58:36,569 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:36,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970976594] [2022-01-31 20:58:36,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1970976594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:36,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:36,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 20:58:36,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623564767] [2022-01-31 20:58:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:36,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 20:58:36,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:36,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 20:58:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-01-31 20:58:36,571 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 26 states, 23 states have (on average 1.434782608695652) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 20:58:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:37,205 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-01-31 20:58:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 20:58:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.434782608695652) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2022-01-31 20:58:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:37,207 INFO L225 Difference]: With dead ends: 76 [2022-01-31 20:58:37,207 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 20:58:37,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=338, Invalid=1732, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 20:58:37,208 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:37,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 109 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 373 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2022-01-31 20:58:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 20:58:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-01-31 20:58:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 20:58:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-01-31 20:58:37,217 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 57 [2022-01-31 20:58:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:37,217 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-01-31 20:58:37,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.434782608695652) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 20:58:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-01-31 20:58:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 20:58:37,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:37,218 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:37,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 20:58:37,218 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 1 times [2022-01-31 20:58:37,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021981093] [2022-01-31 20:58:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:37,342 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:37,342 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:37,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 20:58:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 20:58:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 20:58:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:59:08,158 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:59:08,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021981093] [2022-01-31 20:59:08,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1021981093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:59:08,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:59:08,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 20:59:08,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496672213] [2022-01-31 20:59:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:59:08,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 20:59:08,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:59:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 20:59:08,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=741, Unknown=18, NotChecked=0, Total=930 [2022-01-31 20:59:08,161 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 28 states, 25 states have (on average 1.4) internal successors, (35), 19 states have internal predecessors, (35), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 20:59:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:59:17,731 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-01-31 20:59:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 20:59:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.4) internal successors, (35), 19 states have internal predecessors, (35), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2022-01-31 20:59:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:59:17,732 INFO L225 Difference]: With dead ends: 71 [2022-01-31 20:59:17,732 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:59:17,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=386, Invalid=1849, Unknown=21, NotChecked=0, Total=2256 [2022-01-31 20:59:17,733 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:59:17,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 122 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 62 Invalid, 0 Unknown, 133 Unchecked, 0.0s Time] [2022-01-31 20:59:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:59:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:59:17,734 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) [2022-01-31 20:59:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:59:17,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-01-31 20:59:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:59:17,735 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:59:17,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.4) internal successors, (35), 19 states have internal predecessors, (35), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 20:59:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:59:17,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:59:17,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:59:17,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 20:59:17,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:59:35,867 WARN L228 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 202 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 20:59:47,805 WARN L228 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 202 DAG size of output: 59 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 20:59:47,856 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 20:59:47,856 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 20:59:47,856 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 20:59:47,856 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-31 20:59:47,857 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:59:47,857 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:59:47,857 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:59:47,857 INFO L861 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-01-31 20:59:47,857 INFO L854 garLoopResultBuilder]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2022-01-31 20:59:47,857 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2022-01-31 20:59:47,857 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-01-31 20:59:47,857 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-01-31 20:59:47,857 INFO L854 garLoopResultBuilder]: At program point L44(lines 44 45) the Hoare annotation is: (and (<= (+ 2 main_~in~0) main_~inlen~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-01-31 20:59:47,857 INFO L854 garLoopResultBuilder]: At program point L32(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2022-01-31 20:59:47,857 INFO L861 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0))) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0)) (and (< 0 (+ main_~buflim~0 1)) (= main_~in~0 0) (= main_~buf~0 0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (not (= main_~buf~0 main_~buflim~0)) (<= (+ 2 main_~buflim~0) main_~bufferlen~0))) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0)) (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) (<= 3 main_~inlen~0))) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L37-1(lines 37 48) the Hoare annotation is: (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0)) (and (< 0 (+ main_~buflim~0 1)) (= main_~in~0 0) (<= 0 (+ 2147483648 |main_#t~nondet3|)) (= main_~buf~0 0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= |main_#t~nondet3| 2147483647) (<= (+ 2 main_~buflim~0) main_~bufferlen~0))) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0))) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (<= 2 main_~bufferlen~0)) (.cse2 (<= 0 main_~buf~0))) (or (and .cse1 (<= 1 main_~in~0) .cse2) (and (= main_~in~0 0) .cse1 .cse2))))) (or (and (= main_~buf~0 0) .cse0) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 3 main_~inlen~0) .cse0))) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= (+ main_~in~0 1) main_~inlen~0)) [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= (+ main_~in~0 1) main_~inlen~0)) [2022-01-31 20:59:47,858 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2022-01-31 20:59:47,858 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (= main_~in~0 0))) (and (or (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 3 main_~inlen~0) (let ((.cse1 (<= 2 main_~bufferlen~0)) (.cse2 (<= 0 main_~buf~0))) (or (and .cse1 (<= 1 main_~in~0) .cse2) (and .cse0 .cse1 .cse2))))) [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L854 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (or (and (<= 2 main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= (+ main_~in~0 1) main_~inlen~0)) (and (< 0 (+ main_~buflim~0 1)) (= main_~in~0 0) (= main_~buf~0 0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ 2 main_~buflim~0) main_~bufferlen~0))) [2022-01-31 20:59:47,859 INFO L854 garLoopResultBuilder]: At program point L39(lines 39 40) the Hoare annotation is: (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0)) (and (< 0 (+ main_~buflim~0 1)) (= main_~in~0 0) (= main_~buf~0 0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ 2 main_~buflim~0) main_~bufferlen~0))) [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:59:47,859 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse6 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (forall ((v_main_~bufferlen~0_18 Int) (v_main_~buf~0_37 Int)) (or (let ((.cse0 (< v_main_~buf~0_37 v_main_~bufferlen~0_18))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0) (or (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))))) (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_5 Int) (v_main_~buf~0_36 Int)) (let ((.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 1))) (.cse4 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (or (let ((.cse1 (<= 0 v_main_~buf~0_37))) (and (or .cse1 .cse2) (or (not .cse1) .cse3))) (not (< 0 .cse4)) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (let ((.cse5 (<= 0 v_main_~buf~0_36))) (and (or .cse2 .cse5) (or (not .cse5) .cse3))) (and (or (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)) (<= .cse4 v_main_~buf~0_36) (not (< 0 v_main_~buf~0_36))) (or (not (= v_main_~in~0_BEFORE_RETURN_2 0)) (not (= v_main_~buf~0_36 0))))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) .cse6) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_5 Int) (v_main_~buf~0_37 Int) (v_main_~buf~0_36 Int)) (let ((.cse8 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 0))) (.cse9 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 1))) (.cse10 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (or (let ((.cse7 (<= 0 v_main_~buf~0_37))) (and (or .cse7 .cse8) (or (not .cse7) .cse9))) (not (< 0 .cse10)) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (let ((.cse11 (<= 0 v_main_~buf~0_36))) (and (or .cse8 .cse11) (or (not .cse11) .cse9))) (and (or (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)) (<= .cse10 v_main_~buf~0_36) (not (< 0 v_main_~buf~0_36))) (or (not (= v_main_~in~0_BEFORE_RETURN_2 0)) (not (= v_main_~buf~0_36 0))))))) (not (<= main_~buf~0 main_~bufferlen~0)) (exists ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_5 Int) (v_main_~buf~0_37 Int) (v_main_~buf~0_36 Int)) (let ((.cse12 (+ v_main_~buflim~0_BEFORE_RETURN_2 1)) (.cse13 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 1)) (.cse15 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 0))) (and (or (and (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36) (not (<= .cse12 v_main_~buf~0_36)) (< 0 v_main_~buf~0_36)) (and (= v_main_~buf~0_36 0) (= v_main_~in~0_BEFORE_RETURN_2 0))) (let ((.cse14 (<= 0 v_main_~buf~0_37))) (or (and .cse13 .cse14) (and (not .cse14) .cse15))) (not (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2)) (< 0 .cse12) (let ((.cse16 (<= 0 v_main_~buf~0_36))) (or (and .cse13 .cse16) (and (not .cse16) .cse15))))))) (or .cse6 (not (= __VERIFIER_assert_~cond 0))))) [2022-01-31 20:59:47,860 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-31 20:59:47,860 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (let ((.cse6 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (forall ((v_main_~bufferlen~0_18 Int) (v_main_~buf~0_37 Int)) (or (let ((.cse0 (< v_main_~buf~0_37 v_main_~bufferlen~0_18))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0) (or (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))))) (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_5 Int) (v_main_~buf~0_36 Int)) (let ((.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 1))) (.cse4 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (or (let ((.cse1 (<= 0 v_main_~buf~0_37))) (and (or .cse1 .cse2) (or (not .cse1) .cse3))) (not (< 0 .cse4)) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (let ((.cse5 (<= 0 v_main_~buf~0_36))) (and (or .cse2 .cse5) (or (not .cse5) .cse3))) (and (or (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)) (<= .cse4 v_main_~buf~0_36) (not (< 0 v_main_~buf~0_36))) (or (not (= v_main_~in~0_BEFORE_RETURN_2 0)) (not (= v_main_~buf~0_36 0))))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) .cse6) (or .cse6 (not (= __VERIFIER_assert_~cond 0))))) [2022-01-31 20:59:47,860 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:59:47,860 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:59:47,860 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (let ((.cse6 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (forall ((v_main_~bufferlen~0_18 Int) (v_main_~buf~0_37 Int)) (or (let ((.cse0 (< v_main_~buf~0_37 v_main_~bufferlen~0_18))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0) (or (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))))) (forall ((v_main_~buflim~0_BEFORE_RETURN_2 Int) (v_main_~in~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_5 Int) (v_main_~buf~0_36 Int)) (let ((.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_5 1))) (.cse4 (+ v_main_~buflim~0_BEFORE_RETURN_2 1))) (or (let ((.cse1 (<= 0 v_main_~buf~0_37))) (and (or .cse1 .cse2) (or (not .cse1) .cse3))) (not (< 0 .cse4)) (= v_main_~buf~0_36 v_main_~buflim~0_BEFORE_RETURN_2) (let ((.cse5 (<= 0 v_main_~buf~0_36))) (and (or .cse2 .cse5) (or (not .cse5) .cse3))) (and (or (not (= v_main_~in~0_BEFORE_RETURN_2 v_main_~buf~0_36)) (<= .cse4 v_main_~buf~0_36) (not (< 0 v_main_~buf~0_36))) (or (not (= v_main_~in~0_BEFORE_RETURN_2 0)) (not (= v_main_~buf~0_36 0))))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) .cse6) (or .cse6 (not (= __VERIFIER_assert_~cond 0))))) [2022-01-31 20:59:47,862 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:59:47,863 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:59:47,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] [2022-01-31 20:59:47,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] [2022-01-31 20:59:47,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:59:47 BoogieIcfgContainer [2022-01-31 20:59:47,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:59:47,888 INFO L158 Benchmark]: Toolchain (without parser) took 74429.45ms. Allocated memory was 188.7MB in the beginning and 280.0MB in the end (delta: 91.2MB). Free memory was 133.9MB in the beginning and 96.8MB in the end (delta: 37.1MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. [2022-01-31 20:59:47,894 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:59:47,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.00ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 133.7MB in the beginning and 206.1MB in the end (delta: -72.4MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2022-01-31 20:59:47,895 INFO L158 Benchmark]: Boogie Preprocessor took 20.72ms. Allocated memory is still 232.8MB. Free memory was 206.1MB in the beginning and 204.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 20:59:47,895 INFO L158 Benchmark]: RCFGBuilder took 248.29ms. Allocated memory is still 232.8MB. Free memory was 204.0MB in the beginning and 192.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 20:59:47,895 INFO L158 Benchmark]: TraceAbstraction took 73978.14ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 191.9MB in the beginning and 96.8MB in the end (delta: 95.1MB). Peak memory consumption was 141.8MB. Max. memory is 8.0GB. [2022-01-31 20:59:47,897 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.00ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 133.7MB in the beginning and 206.1MB in the end (delta: -72.4MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.72ms. Allocated memory is still 232.8MB. Free memory was 206.1MB in the beginning and 204.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 248.29ms. Allocated memory is still 232.8MB. Free memory was 204.0MB in the beginning and 192.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 73978.14ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 191.9MB in the beginning and 96.8MB in the end (delta: 95.1MB). Peak memory consumption was 141.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] * 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.9s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 261 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 237 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 71 SyntacticMatches, 20 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 41.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 198 PreInvPairs, 287 NumberOfFragments, 1021 HoareAnnotationTreeSize, 198 FomulaSimplifications, 651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 5389 FormulaSimplificationTreeSizeReductionInter, 30.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((2 <= bufferlen && 1 <= in) && 0 <= buf) && 3 <= inlen) && buf + 1 <= bufferlen) && in + 1 <= inlen) || ((((0 < buflim + 1 && in == 0) && buf == 0) && bufferlen + 1 <= inlen) && 2 + buflim <= bufferlen) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufferlen~0_18,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_37,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_5,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buflim~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~in~0_BEFORE_RETURN_2,QUANTIFIED] [2022-01-31 20:59:47,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~buf~0_36,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (((forall v_main_~bufferlen~0_18 : int, v_main_~buf~0_37 : int :: ((!(\old(cond) == 0) || v_main_~buf~0_37 < v_main_~bufferlen~0_18) && (!(v_main_~buf~0_37 < v_main_~bufferlen~0_18) || !(\old(cond) == 1))) || (forall v_main_~buflim~0_BEFORE_RETURN_2 : int, v_main_~in~0_BEFORE_RETURN_2 : int, v___VERIFIER_assert_~cond_BEFORE_RETURN_5 : int, v_main_~buf~0_36 : int :: (((((0 <= v_main_~buf~0_37 || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_5 == 0)) && (!(0 <= v_main_~buf~0_37) || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_5 == 1))) || !(0 < v_main_~buflim~0_BEFORE_RETURN_2 + 1)) || v_main_~buf~0_36 == v_main_~buflim~0_BEFORE_RETURN_2) || ((!(v___VERIFIER_assert_~cond_BEFORE_RETURN_5 == 0) || 0 <= v_main_~buf~0_36) && (!(0 <= v_main_~buf~0_36) || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_5 == 1)))) || (((!(v_main_~in~0_BEFORE_RETURN_2 == v_main_~buf~0_36) || v_main_~buflim~0_BEFORE_RETURN_2 + 1 <= v_main_~buf~0_36) || !(0 < v_main_~buf~0_36)) && (!(v_main_~in~0_BEFORE_RETURN_2 == 0) || !(v_main_~buf~0_36 == 0))))) || \old(cond) == cond) || \old(cond) == 0) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-01-31 20:59:48,118 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-31 20:59:48,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...