/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:23:40,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:23:40,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:23:41,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:23:41,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:23:41,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:23:41,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:23:41,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:23:41,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:23:41,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:23:41,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:23:41,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:23:41,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:23:41,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:23:41,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:23:41,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:23:41,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:23:41,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:23:41,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:23:41,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:23:41,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:23:41,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:23:41,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:23:41,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:23:41,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:23:41,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:23:41,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:23:41,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:23:41,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:23:41,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:23:41,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:23:41,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:23:41,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:23:41,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:23:41,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:23:41,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:23:41,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:23:41,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:23:41,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:23:41,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:23:41,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:23:41,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:23:41,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:23:41,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:23:41,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:23:41,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:23:41,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:23:41,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:23:41,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:23:41,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:23:41,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:41,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:23:41,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:23:41,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:23:41,091 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:23:41,091 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 23:23:41,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:23:41,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:23:41,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:23:41,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:23:41,291 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:23:41,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-01-31 23:23:41,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde770bd4/084c7e1cb6cc4a2ca50d098e514deca2/FLAGfe28757cf [2022-01-31 23:23:41,732 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:23:41,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-01-31 23:23:41,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde770bd4/084c7e1cb6cc4a2ca50d098e514deca2/FLAGfe28757cf [2022-01-31 23:23:41,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde770bd4/084c7e1cb6cc4a2ca50d098e514deca2 [2022-01-31 23:23:41,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:23:41,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:23:41,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:41,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:23:41,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:23:41,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:41" (1/1) ... [2022-01-31 23:23:41,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148fea64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:41, skipping insertion in model container [2022-01-31 23:23:41,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:41" (1/1) ... [2022-01-31 23:23:41,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:23:41,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:23:41,957 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/SpamAssassin-loop.i[893,906] [2022-01-31 23:23:41,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:41,984 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:23:41,993 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/SpamAssassin-loop.i[893,906] [2022-01-31 23:23:41,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:42,009 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:23:42,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42 WrapperNode [2022-01-31 23:23:42,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:42,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:23:42,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:23:42,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:23:42,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:23:42,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:23:42,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:23:42,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:23:42,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (1/1) ... [2022-01-31 23:23:42,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:23:42,076 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 23:23:42,096 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 23:23:42,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:23:42,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:23:42,112 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:23:42,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:23:42,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 23:23:42,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:23:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:23:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:23:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 23:23:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:23:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:23:42,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:23:42,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:23:42,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:23:42,185 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:23:42,186 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:23:42,357 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:23:42,361 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:23:42,362 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 23:23:42,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:42 BoogieIcfgContainer [2022-01-31 23:23:42,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:23:42,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:23:42,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:23:42,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:23:42,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:23:41" (1/3) ... [2022-01-31 23:23:42,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb4149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:42, skipping insertion in model container [2022-01-31 23:23:42,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:42" (2/3) ... [2022-01-31 23:23:42,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb4149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:42, skipping insertion in model container [2022-01-31 23:23:42,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:42" (3/3) ... [2022-01-31 23:23:42,370 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-01-31 23:23:42,373 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:23:42,374 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:23:42,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:23:42,410 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=QVASR [2022-01-31 23:23:42,410 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:23:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 23:23:42,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:42,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:42,428 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2022-01-31 23:23:42,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:42,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171144090] [2022-01-31 23:23:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:42,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:42,495 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:42,689 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 23:23:42,690 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:42,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171144090] [2022-01-31 23:23:42,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [171144090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:42,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:42,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:42,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954595381] [2022-01-31 23:23:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:42,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:42,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:42,724 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 23:23:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:43,069 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2022-01-31 23:23:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-01-31 23:23:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:43,082 INFO L225 Difference]: With dead ends: 88 [2022-01-31 23:23:43,082 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 23:23:43,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:43,089 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:43,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 23:23:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-31 23:23:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-01-31 23:23:43,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-01-31 23:23:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:43,133 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-01-31 23:23:43,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 23:23:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-01-31 23:23:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 23:23:43,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:43,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:43,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:23:43,135 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2022-01-31 23:23:43,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:43,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793662952] [2022-01-31 23:23:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:43,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:43,138 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,190 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 23:23:43,190 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:43,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793662952] [2022-01-31 23:23:43,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [793662952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:43,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:43,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:43,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450773370] [2022-01-31 23:23:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:43,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:43,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:43,193 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 23:23:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:43,382 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-01-31 23:23:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-01-31 23:23:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:43,387 INFO L225 Difference]: With dead ends: 55 [2022-01-31 23:23:43,387 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 23:23:43,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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 23:23:43,393 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:43,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 23:23:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-01-31 23:23:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-01-31 23:23:43,423 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-01-31 23:23:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:43,424 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-01-31 23:23:43,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 23:23:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-01-31 23:23:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:23:43,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:43,426 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:43,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:23:43,426 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2022-01-31 23:23:43,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:43,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1093074137] [2022-01-31 23:23:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:43,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:43,436 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:23:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,501 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 23:23:43,501 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1093074137] [2022-01-31 23:23:43,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1093074137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:43,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:43,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:43,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607428582] [2022-01-31 23:23:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:43,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:43,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:43,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:43,503 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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 23:23:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:43,680 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-01-31 23:23:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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 19 [2022-01-31 23:23:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:43,684 INFO L225 Difference]: With dead ends: 57 [2022-01-31 23:23:43,684 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 23:23:43,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:43,691 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:43,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 23:23:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-01-31 23:23:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-01-31 23:23:43,716 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-01-31 23:23:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:43,716 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-01-31 23:23:43,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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 23:23:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-01-31 23:23:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 23:23:43,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:43,717 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] [2022-01-31 23:23:43,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:23:43,718 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2022-01-31 23:23:43,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:43,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276999189] [2022-01-31 23:23:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:43,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:43,723 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:23:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:23:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:43,841 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 23:23:43,842 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:43,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276999189] [2022-01-31 23:23:43,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [276999189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:43,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:43,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:43,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450958229] [2022-01-31 23:23:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:43,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:43,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:43,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:43,844 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 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 23:23:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:44,040 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-01-31 23:23:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:44,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 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 24 [2022-01-31 23:23:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:44,042 INFO L225 Difference]: With dead ends: 61 [2022-01-31 23:23:44,042 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 23:23:44,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:44,048 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:44,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 23:23:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-31 23:23:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-01-31 23:23:44,069 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-01-31 23:23:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:44,070 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-01-31 23:23:44,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 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 23:23:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-01-31 23:23:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 23:23:44,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:44,073 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] [2022-01-31 23:23:44,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:23:44,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2022-01-31 23:23:44,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611632924] [2022-01-31 23:23:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:44,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:44,076 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:23:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:23:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:23:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,178 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 23:23:44,178 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:44,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611632924] [2022-01-31 23:23:44,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [611632924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:44,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:44,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:44,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302100440] [2022-01-31 23:23:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:44,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:44,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:44,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:44,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:44,182 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 23:23:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:44,342 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-01-31 23:23:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-01-31 23:23:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:44,348 INFO L225 Difference]: With dead ends: 66 [2022-01-31 23:23:44,348 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 23:23:44,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:44,349 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:44,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 23:23:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-01-31 23:23:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-01-31 23:23:44,377 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-01-31 23:23:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:44,377 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-01-31 23:23:44,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 23:23:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-01-31 23:23:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 23:23:44,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:44,382 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:44,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:23:44,382 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2022-01-31 23:23:44,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:44,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25281868] [2022-01-31 23:23:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:44,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:44,384 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:23:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:23:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 23:23:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:23:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:23:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 23:23:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,485 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 23:23:44,485 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:44,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25281868] [2022-01-31 23:23:44,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [25281868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:44,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:44,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:44,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454799657] [2022-01-31 23:23:44,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:44,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:44,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:44,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:44,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:44,486 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:23:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:44,704 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-01-31 23:23:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-01-31 23:23:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:44,706 INFO L225 Difference]: With dead ends: 75 [2022-01-31 23:23:44,706 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 23:23:44,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:44,709 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:44,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 23:23:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-01-31 23:23:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-01-31 23:23:44,726 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-01-31 23:23:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:44,727 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-01-31 23:23:44,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:23:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-01-31 23:23:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 23:23:44,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:44,732 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 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 23:23:44,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:23:44,733 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2022-01-31 23:23:44,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:44,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921288320] [2022-01-31 23:23:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:44,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:44,735 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:23:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:23:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 23:23:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:23:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:23:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 23:23:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 23:23:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 23:23:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 23:23:44,872 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921288320] [2022-01-31 23:23:44,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1921288320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:44,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:44,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:44,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320482177] [2022-01-31 23:23:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:44,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:44,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:44,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:44,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:44,875 INFO L87 Difference]: Start difference. First operand 67 states and 79 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 23:23:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:45,098 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-01-31 23:23:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:45,098 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-01-31 23:23:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:45,100 INFO L225 Difference]: With dead ends: 75 [2022-01-31 23:23:45,100 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 23:23:45,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:23:45,101 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:45,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 23:23:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-01-31 23:23:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 23:23:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-01-31 23:23:45,112 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-01-31 23:23:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:45,113 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-01-31 23:23:45,113 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 23:23:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-01-31 23:23:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 23:23:45,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:45,114 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:45,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:23:45,114 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:23:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2022-01-31 23:23:45,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:45,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618343846] [2022-01-31 23:23:45,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:45,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:45,117 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:23:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:23:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 23:23:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:23:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:23:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 23:23:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 23:23:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 23:23:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 23:23:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 23:23:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 23:23:45,226 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618343846] [2022-01-31 23:23:45,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1618343846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:45,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:45,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 23:23:45,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140563504] [2022-01-31 23:23:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:45,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 23:23:45,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 23:23:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:23:45,228 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 23:23:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:45,460 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-01-31 23:23:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:23:45,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-01-31 23:23:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:45,463 INFO L225 Difference]: With dead ends: 73 [2022-01-31 23:23:45,463 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:23:45,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:23:45,465 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:45,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 61 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:23:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:23:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:23:45,466 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 23:23:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:23:45,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-01-31 23:23:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:45,466 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:23:45,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 23:23:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:23:45,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:23:45,468 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 23:23:45,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:23:45,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:23:45,856 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-01-31 23:23:45,857 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,857 INFO L861 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,858 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,858 INFO L854 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L36(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,859 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,860 INFO L854 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,860 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2022-01-31 23:23:45,860 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,860 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,860 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,860 INFO L861 garLoopResultBuilder]: At program point L34-3(lines 34 65) the Hoare annotation is: true [2022-01-31 23:23:45,860 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2022-01-31 23:23:45,860 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,860 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-01-31 23:23:45,861 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,861 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-01-31 23:23:45,861 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:23:45,861 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 23:23:45,861 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:23:45,861 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:23:45,861 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 23:23:45,861 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 23:23:45,861 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:23:45,861 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 23:23:45,862 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-31 23:23:45,862 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 23:23:45,862 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 23:23:45,862 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 23:23:45,862 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 23:23:45,866 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:45,867 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:23:45,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:23:45 BoogieIcfgContainer [2022-01-31 23:23:45,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:23:45,886 INFO L158 Benchmark]: Toolchain (without parser) took 4123.85ms. Allocated memory was 175.1MB in the beginning and 216.0MB in the end (delta: 40.9MB). Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 286.9kB). Peak memory consumption was 42.7MB. Max. memory is 8.0GB. [2022-01-31 23:23:45,886 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 91.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:23:45,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.52ms. Allocated memory is still 175.1MB. Free memory was 125.6MB in the beginning and 151.5MB in the end (delta: -25.9MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-01-31 23:23:45,887 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 175.1MB. Free memory was 151.5MB in the beginning and 150.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 23:23:45,887 INFO L158 Benchmark]: RCFGBuilder took 328.70ms. Allocated memory is still 175.1MB. Free memory was 150.0MB in the beginning and 137.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 23:23:45,887 INFO L158 Benchmark]: TraceAbstraction took 3519.82ms. Allocated memory was 175.1MB in the beginning and 216.0MB in the end (delta: 40.9MB). Free memory was 137.4MB in the beginning and 125.5MB in the end (delta: 11.9MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-01-31 23:23:45,889 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.11ms. Allocated memory is still 175.1MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 91.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.52ms. Allocated memory is still 175.1MB. Free memory was 125.6MB in the beginning and 151.5MB in the end (delta: -25.9MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 175.1MB. Free memory was 151.5MB in the beginning and 150.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 328.70ms. Allocated memory is still 175.1MB. Free memory was 150.0MB in the beginning and 137.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3519.82ms. Allocated memory was 175.1MB in the beginning and 216.0MB in the end (delta: 40.9MB). Free memory was 137.4MB in the beginning and 125.5MB in the end (delta: 11.9MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1482 IncrementalHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 294 mSDtfsCounter, 1482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, 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, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 235 PreInvPairs, 302 NumberOfFragments, 561 HoareAnnotationTreeSize, 235 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 43 FomulaSimplificationsInter, 581 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-01-31 23:23:45,932 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 0 Received shutdown request...