/usr/bin/java -ea -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:13:47,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:13:47,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:13:48,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:13:48,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:13:48,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:13:48,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:13:48,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:13:48,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:13:48,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:13:48,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:13:48,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:13:48,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:13:48,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:13:48,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:13:48,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:13:48,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:13:48,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:13:48,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:13:48,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:13:48,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:13:48,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:13:48,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:13:48,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:13:48,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:13:48,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:13:48,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:13:48,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:13:48,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:13:48,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:13:48,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:13:48,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:13:48,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:13:48,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:13:48,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:13:48,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:13:48,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:13:48,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:13:48,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:13:48,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:13:48,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:13:48,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:13:48,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:13:48,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:13:48,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:13:48,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:13:48,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:13:48,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:13:48,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:13:48,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:13:48,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:13:48,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:13:48,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:13:48,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:13:48,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:13:48,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:13:48,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:13:48,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:13:48,086 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:13:48,086 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-04-27 16:13:48,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:13:48,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:13:48,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:13:48,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:13:48,273 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:13:48,274 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-04-27 16:13:48,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de1af69/d0e1f52822eb47bcaa46c3cc907a727b/FLAGbba439d71 [2022-04-27 16:13:48,666 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:13:48,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-04-27 16:13:48,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de1af69/d0e1f52822eb47bcaa46c3cc907a727b/FLAGbba439d71 [2022-04-27 16:13:49,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de1af69/d0e1f52822eb47bcaa46c3cc907a727b [2022-04-27 16:13:49,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:13:49,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:13:49,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:13:49,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:13:49,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:13:49,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2496c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49, skipping insertion in model container [2022-04-27 16:13:49,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:13:49,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:13:49,231 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-04-27 16:13:49,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:13:49,265 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:13:49,295 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-04-27 16:13:49,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:13:49,310 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:13:49,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49 WrapperNode [2022-04-27 16:13:49,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:13:49,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:13:49,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:13:49,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:13:49,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:13:49,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:13:49,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:13:49,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:13:49,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:13:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:13:49,388 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-04-27 16:13:49,391 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-04-27 16:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:13:49,462 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:13:49,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:13:49,650 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:13:49,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:13:49,654 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:13:49,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:49 BoogieIcfgContainer [2022-04-27 16:13:49,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:13:49,656 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:13:49,656 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:13:49,657 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:13:49,659 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:49" (1/1) ... [2022-04-27 16:13:49,660 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:13:49,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:13:49 BasicIcfg [2022-04-27 16:13:49,720 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:13:49,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:13:49,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:13:49,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:13:49,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:13:49" (1/4) ... [2022-04-27 16:13:49,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2775b8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:13:49, skipping insertion in model container [2022-04-27 16:13:49,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:49" (2/4) ... [2022-04-27 16:13:49,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2775b8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:13:49, skipping insertion in model container [2022-04-27 16:13:49,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:49" (3/4) ... [2022-04-27 16:13:49,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2775b8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:13:49, skipping insertion in model container [2022-04-27 16:13:49,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:13:49" (4/4) ... [2022-04-27 16:13:49,728 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.iJordan [2022-04-27 16:13:49,737 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:13:49,737 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:13:49,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:13:49,785 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16edcc53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73bd99f6 [2022-04-27 16:13:49,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:13:49,791 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-04-27 16:13:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:13:49,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:49,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:49,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -868390563, now seen corresponding path program 1 times [2022-04-27 16:13:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:49,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287394097] [2022-04-27 16:13:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:49,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {46#true} is VALID [2022-04-27 16:13:49,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-27 16:13:49,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-27 16:13:49,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {46#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:49,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {46#true} is VALID [2022-04-27 16:13:49,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-27 16:13:49,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-27 16:13:49,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {46#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-27 16:13:49,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {46#true} is VALID [2022-04-27 16:13:49,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {46#true} is VALID [2022-04-27 16:13:49,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {46#true} is VALID [2022-04-27 16:13:49,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#true} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-27 16:13:49,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#true} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {51#(not (<= main_~len~0 (+ main_~i~0 1)))} is VALID [2022-04-27 16:13:49,970 INFO L272 TraceCheckUtils]: 10: Hoare triple {51#(not (<= main_~len~0 (+ main_~i~0 1)))} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {52#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:49,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {53#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:49,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {47#false} is VALID [2022-04-27 16:13:49,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#false} is VALID [2022-04-27 16:13:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:13:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:49,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287394097] [2022-04-27 16:13:49,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287394097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:49,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:49,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757898839] [2022-04-27 16:13:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:49,977 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-04-27 16:13:49,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:49,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:49,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:49,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:50,019 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-04-27 16:13:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:50,641 INFO L93 Difference]: Finished difference Result 52 states and 74 transitions. [2022-04-27 16:13:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:50,642 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-04-27 16:13:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-04-27 16:13:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-04-27 16:13:50,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2022-04-27 16:13:50,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:50,782 INFO L225 Difference]: With dead ends: 52 [2022-04-27 16:13:50,782 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 16:13:50,784 INFO L412 NwaCegarLoop]: 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-04-27 16:13:50,786 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:50,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:13:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 16:13:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-04-27 16:13:50,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:50,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second 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-04-27 16:13:50,808 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second 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-04-27 16:13:50,809 INFO L87 Difference]: Start difference. First operand 47 states. Second 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-04-27 16:13:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:50,819 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-27 16:13:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-27 16:13:50,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:50,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:50,821 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 47 states. [2022-04-27 16:13:50,821 INFO L87 Difference]: Start difference. First 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) Second operand 47 states. [2022-04-27 16:13:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:50,826 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-27 16:13:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-27 16:13:50,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:50,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:50,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:50,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:50,828 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-04-27 16:13:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-27 16:13:50,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-04-27 16:13:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:50,832 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-27 16:13:50,832 INFO L496 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-04-27 16:13:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-27 16:13:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:13:50,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:50,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:50,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:13:50,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash -867437251, now seen corresponding path program 1 times [2022-04-27 16:13:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:50,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106805621] [2022-04-27 16:13:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:50,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:50,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {254#true} is VALID [2022-04-27 16:13:50,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 16:13:50,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 16:13:50,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:50,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {254#true} is VALID [2022-04-27 16:13:50,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 16:13:50,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 16:13:50,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 16:13:50,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {254#true} is VALID [2022-04-27 16:13:50,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {254#true} is VALID [2022-04-27 16:13:50,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {259#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-27 16:13:50,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(not (<= main_~len~0 main_~i~0))} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {259#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-27 16:13:50,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(not (<= main_~len~0 main_~i~0))} [146] L36-->L56: Formula: (not (< (+ v_main_~i~0_21 1) v_main_~len~0_11)) InVars {main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} OutVars{main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} AuxVars[] AssignedVars[] {259#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-27 16:13:50,914 INFO L272 TraceCheckUtils]: 10: Hoare triple {259#(not (<= main_~len~0 main_~i~0))} [148] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {260#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:50,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {261#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:50,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {261#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-27 16:13:50,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-27 16:13:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:13:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:50,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106805621] [2022-04-27 16:13:50,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106805621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:50,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:50,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45315885] [2022-04-27 16:13:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:50,917 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-04-27 16:13:50,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:50,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:50,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:50,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:50,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:50,929 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-04-27 16:13:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:51,363 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 16:13:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:51,363 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-04-27 16:13:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-27 16:13:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-27 16:13:51,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-27 16:13:51,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:51,449 INFO L225 Difference]: With dead ends: 53 [2022-04-27 16:13:51,450 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 16:13:51,451 INFO L412 NwaCegarLoop]: 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-04-27 16:13:51,453 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:51,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:13:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 16:13:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-27 16:13:51,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:51,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second 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-04-27 16:13:51,468 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second 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-04-27 16:13:51,468 INFO L87 Difference]: Start difference. First operand 53 states. Second 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-04-27 16:13:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:51,475 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 16:13:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-27 16:13:51,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:51,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:51,476 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 53 states. [2022-04-27 16:13:51,476 INFO L87 Difference]: Start difference. First 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) Second operand 53 states. [2022-04-27 16:13:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:51,495 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 16:13:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-27 16:13:51,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:51,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:51,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:51,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:51,499 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-04-27 16:13:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-04-27 16:13:51,504 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-04-27 16:13:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:51,504 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-04-27 16:13:51,504 INFO L496 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-04-27 16:13:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 16:13:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 16:13:51,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:51,524 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:13:51,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1607544442, now seen corresponding path program 1 times [2022-04-27 16:13:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:51,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216960505] [2022-04-27 16:13:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:51,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {483#true} is VALID [2022-04-27 16:13:51,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {483#true} {483#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:13:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:51,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {483#true} is VALID [2022-04-27 16:13:51,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {483#true} {488#(<= 0 main_~i~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {488#(<= 0 main_~i~0)} is VALID [2022-04-27 16:13:51,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {483#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:51,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {483#true} is VALID [2022-04-27 16:13:51,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {483#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {483#true} is VALID [2022-04-27 16:13:51,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {488#(<= 0 main_~i~0)} is VALID [2022-04-27 16:13:51,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {488#(<= 0 main_~i~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {488#(<= 0 main_~i~0)} is VALID [2022-04-27 16:13:51,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= 0 main_~i~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {488#(<= 0 main_~i~0)} is VALID [2022-04-27 16:13:51,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(<= 0 main_~i~0)} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {488#(<= 0 main_~i~0)} is VALID [2022-04-27 16:13:51,589 INFO L272 TraceCheckUtils]: 10: Hoare triple {488#(<= 0 main_~i~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {483#true} is VALID [2022-04-27 16:13:51,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {483#true} is VALID [2022-04-27 16:13:51,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {483#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {483#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#true} is VALID [2022-04-27 16:13:51,590 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {483#true} {488#(<= 0 main_~i~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {488#(<= 0 main_~i~0)} is VALID [2022-04-27 16:13:51,591 INFO L272 TraceCheckUtils]: 15: Hoare triple {488#(<= 0 main_~i~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:51,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {494#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:51,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {494#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {484#false} is VALID [2022-04-27 16:13:51,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#false} is VALID [2022-04-27 16:13:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:13:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:51,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216960505] [2022-04-27 16:13:51,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216960505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:51,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:51,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023883565] [2022-04-27 16:13:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:51,593 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-04-27 16:13:51,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:51,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:51,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:51,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:51,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:51,605 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-04-27 16:13:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:51,993 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 16:13:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:51,993 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-04-27 16:13:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 16:13:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 16:13:51,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 16:13:52,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:52,051 INFO L225 Difference]: With dead ends: 55 [2022-04-27 16:13:52,051 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 16:13:52,051 INFO L412 NwaCegarLoop]: 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-04-27 16:13:52,052 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:52,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:13:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 16:13:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 16:13:52,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:52,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second 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-04-27 16:13:52,056 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second 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-04-27 16:13:52,056 INFO L87 Difference]: Start difference. First operand 55 states. Second 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-04-27 16:13:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:52,058 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 16:13:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 16:13:52,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:52,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:52,059 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 55 states. [2022-04-27 16:13:52,059 INFO L87 Difference]: Start difference. First 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) Second operand 55 states. [2022-04-27 16:13:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:52,061 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 16:13:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 16:13:52,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:52,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:52,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:52,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:52,062 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-04-27 16:13:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-27 16:13:52,064 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-04-27 16:13:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:52,064 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-27 16:13:52,064 INFO L496 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-04-27 16:13:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 16:13:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 16:13:52,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:52,065 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:52,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:13:52,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1153064602, now seen corresponding path program 1 times [2022-04-27 16:13:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:52,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478804325] [2022-04-27 16:13:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {726#true} is VALID [2022-04-27 16:13:52,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {726#true} {726#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:13:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {726#true} is VALID [2022-04-27 16:13:52,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {726#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {726#true} {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 16:13:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {726#true} is VALID [2022-04-27 16:13:52,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {726#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {726#true} {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {726#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:52,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {726#true} is VALID [2022-04-27 16:13:52,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {726#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {726#true} {726#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {726#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {726#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {726#true} is VALID [2022-04-27 16:13:52,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {726#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {731#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#(<= (+ main_~limit~0 4) main_~bufsize~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {731#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#(<= (+ main_~limit~0 4) main_~bufsize~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [146] L36-->L56: Formula: (not (< (+ v_main_~i~0_21 1) v_main_~len~0_11)) InVars {main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} OutVars{main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} AuxVars[] AssignedVars[] {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,129 INFO L272 TraceCheckUtils]: 10: Hoare triple {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [148] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {726#true} is VALID [2022-04-27 16:13:52,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {726#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {726#true} is VALID [2022-04-27 16:13:52,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {726#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {726#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,130 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {726#true} {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,130 INFO L272 TraceCheckUtils]: 15: Hoare triple {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [151] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {726#true} is VALID [2022-04-27 16:13:52,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {726#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {726#true} is VALID [2022-04-27 16:13:52,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {726#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-27 16:13:52,131 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {726#true} {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:52,132 INFO L272 TraceCheckUtils]: 20: Hoare triple {732#(<= (+ 5 main_~j~0) main_~bufsize~0)} [155] L58-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {741#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:52,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {741#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {742#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:52,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {742#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {727#false} is VALID [2022-04-27 16:13:52,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {727#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#false} is VALID [2022-04-27 16:13:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:13:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:52,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478804325] [2022-04-27 16:13:52,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478804325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:52,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:52,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:13:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831202939] [2022-04-27 16:13:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:52,134 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-04-27 16:13:52,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:52,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:52,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:52,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:13:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:13:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:13:52,147 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-04-27 16:13:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:52,665 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 16:13:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:13:52,665 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-04-27 16:13:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-27 16:13:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-27 16:13:52,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-27 16:13:52,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:52,727 INFO L225 Difference]: With dead ends: 59 [2022-04-27 16:13:52,727 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 16:13:52,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:13:52,728 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:52,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:13:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 16:13:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-27 16:13:52,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:52,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second 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-04-27 16:13:52,732 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second 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-04-27 16:13:52,732 INFO L87 Difference]: Start difference. First operand 59 states. Second 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-04-27 16:13:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:52,734 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 16:13:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 16:13:52,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:52,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:52,735 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 59 states. [2022-04-27 16:13:52,735 INFO L87 Difference]: Start difference. First 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) Second operand 59 states. [2022-04-27 16:13:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:52,737 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 16:13:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 16:13:52,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:52,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:52,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:52,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:52,738 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-04-27 16:13:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-27 16:13:52,740 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-04-27 16:13:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:52,740 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-04-27 16:13:52,740 INFO L496 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-04-27 16:13:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 16:13:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 16:13:52,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:52,741 INFO L195 NwaCegarLoop]: 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-04-27 16:13:52,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:13:52,741 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1359459551, now seen corresponding path program 1 times [2022-04-27 16:13:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722094897] [2022-04-27 16:13:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {1012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {992#true} is VALID [2022-04-27 16:13:52,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {992#true} {992#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:13:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {992#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#true} is VALID [2022-04-27 16:13:52,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {992#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {992#true} {997#(<= 0 main_~j~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 16:13:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {992#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#true} is VALID [2022-04-27 16:13:52,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {992#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {992#true} {997#(<= 0 main_~j~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 16:13:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:52,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {992#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#true} is VALID [2022-04-27 16:13:52,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {992#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {992#true} {997#(<= 0 main_~j~0)} [192] __VERIFIER_assertEXIT-->L59: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {992#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:52,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {992#true} is VALID [2022-04-27 16:13:52,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {992#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {992#true} {992#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {992#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {992#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {992#true} is VALID [2022-04-27 16:13:52,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {992#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {992#true} is VALID [2022-04-27 16:13:52,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {992#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {997#(<= 0 main_~j~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(<= 0 main_~j~0)} [146] L36-->L56: Formula: (not (< (+ v_main_~i~0_21 1) v_main_~len~0_11)) InVars {main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} OutVars{main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} AuxVars[] AssignedVars[] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,803 INFO L272 TraceCheckUtils]: 10: Hoare triple {997#(<= 0 main_~j~0)} [148] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {992#true} is VALID [2022-04-27 16:13:52,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {992#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#true} is VALID [2022-04-27 16:13:52,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,804 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {992#true} {997#(<= 0 main_~j~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,804 INFO L272 TraceCheckUtils]: 15: Hoare triple {997#(<= 0 main_~j~0)} [151] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {992#true} is VALID [2022-04-27 16:13:52,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {992#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#true} is VALID [2022-04-27 16:13:52,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {992#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {992#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,805 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {992#true} {997#(<= 0 main_~j~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,805 INFO L272 TraceCheckUtils]: 20: Hoare triple {997#(<= 0 main_~j~0)} [155] L58-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {992#true} is VALID [2022-04-27 16:13:52,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {992#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#true} is VALID [2022-04-27 16:13:52,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {992#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {992#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-27 16:13:52,806 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {992#true} {997#(<= 0 main_~j~0)} [192] __VERIFIER_assertEXIT-->L59: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {997#(<= 0 main_~j~0)} is VALID [2022-04-27 16:13:52,807 INFO L272 TraceCheckUtils]: 25: Hoare triple {997#(<= 0 main_~j~0)} [161] L59-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_28) 1 0) |v___VERIFIER_assert_#in~condInParam_16|) InVars {main_~j~0=v_main_~j~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_16|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1010#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:52,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {1010#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1011#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:52,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {1011#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {993#false} is VALID [2022-04-27 16:13:52,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {993#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {993#false} is VALID [2022-04-27 16:13:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 16:13:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:52,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722094897] [2022-04-27 16:13:52,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722094897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:52,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:52,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331112535] [2022-04-27 16:13:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:52,809 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-04-27 16:13:52,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:52,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:52,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:52,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:52,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:52,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:52,823 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-04-27 16:13:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:53,192 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 16:13:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:53,192 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-04-27 16:13:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 16:13:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 16:13:53,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-27 16:13:53,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:53,241 INFO L225 Difference]: With dead ends: 64 [2022-04-27 16:13:53,242 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 16:13:53,242 INFO L412 NwaCegarLoop]: 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-04-27 16:13:53,242 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:53,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:13:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 16:13:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 16:13:53,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:53,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second 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-04-27 16:13:53,246 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second 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-04-27 16:13:53,246 INFO L87 Difference]: Start difference. First operand 64 states. Second 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-04-27 16:13:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:53,248 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 16:13:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 16:13:53,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:53,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:53,249 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 64 states. [2022-04-27 16:13:53,249 INFO L87 Difference]: Start difference. First 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) Second operand 64 states. [2022-04-27 16:13:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:53,254 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 16:13:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 16:13:53,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:53,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:53,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:53,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:53,255 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-04-27 16:13:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 16:13:53,257 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-04-27 16:13:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:53,258 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 16:13:53,258 INFO L496 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-04-27 16:13:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 16:13:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 16:13:53,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:53,271 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:53,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:13:53,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1056918318, now seen corresponding path program 1 times [2022-04-27 16:13:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:53,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294520764] [2022-04-27 16:13:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {1311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1278#true} is VALID [2022-04-27 16:13:53,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1278#true} {1278#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:13:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 16:13:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 16:13:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 16:13:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 16:13:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 16:13:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:53,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {1278#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:53,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1278#true} is VALID [2022-04-27 16:13:53,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1278#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {1278#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {1278#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1278#true} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1278#true} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,415 INFO L272 TraceCheckUtils]: 10: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1278#true} is VALID [2022-04-27 16:13:53,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,415 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,415 INFO L272 TraceCheckUtils]: 15: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1278#true} is VALID [2022-04-27 16:13:53,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,416 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [152] L38-->L39: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_#t~nondet3=|v_main_#t~nondet3_1|} OutVars{main_#t~nondet3=|v_main_#t~nondet3_1|} AuxVars[] AssignedVars[] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [157] L39-->L40: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,417 INFO L272 TraceCheckUtils]: 22: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [162] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1278#true} is VALID [2022-04-27 16:13:53,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,418 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,418 INFO L272 TraceCheckUtils]: 27: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [164] L40-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1278#true} is VALID [2022-04-27 16:13:53,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,419 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,419 INFO L272 TraceCheckUtils]: 32: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [165] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1278#true} is VALID [2022-04-27 16:13:53,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,419 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,420 INFO L272 TraceCheckUtils]: 37: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [166] L42-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1278#true} is VALID [2022-04-27 16:13:53,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {1278#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1278#true} is VALID [2022-04-27 16:13:53,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {1278#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {1278#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1278#true} is VALID [2022-04-27 16:13:53,420 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1278#true} {1283#(<= (+ main_~i~0 2) main_~len~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1283#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-27 16:13:53,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {1283#(<= (+ main_~i~0 2) main_~len~0)} [167] L43-->L46: Formula: (and (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) (= v_main_~j~0_11 (+ v_main_~j~0_12 1))) InVars {main_~i~0=v_main_~i~0_16, main_~j~0=v_main_~j~0_12} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_11} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post4, main_#t~post5] {1308#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2022-04-27 16:13:53,421 INFO L272 TraceCheckUtils]: 43: Hoare triple {1308#(<= (+ main_~i~0 1) main_~len~0)} [174] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1309#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:53,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {1309#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1310#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:53,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {1310#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1279#false} is VALID [2022-04-27 16:13:53,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {1279#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1279#false} is VALID [2022-04-27 16:13:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 16:13:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:53,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294520764] [2022-04-27 16:13:53,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294520764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:53,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:53,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:13:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467001170] [2022-04-27 16:13:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:53,423 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-04-27 16:13:53,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:53,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:53,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:53,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:13:53,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:53,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:13:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:13:53,443 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-04-27 16:13:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:53,940 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 16:13:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:13:53,941 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-04-27 16:13:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-27 16:13:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-27 16:13:53,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2022-04-27 16:13:54,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:54,005 INFO L225 Difference]: With dead ends: 73 [2022-04-27 16:13:54,005 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 16:13:54,005 INFO L412 NwaCegarLoop]: 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-04-27 16:13:54,006 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:54,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:13:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 16:13:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-27 16:13:54,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:54,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second 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-04-27 16:13:54,010 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second 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-04-27 16:13:54,010 INFO L87 Difference]: Start difference. First operand 73 states. Second 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-04-27 16:13:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:54,012 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 16:13:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 16:13:54,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:54,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:54,013 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 73 states. [2022-04-27 16:13:54,013 INFO L87 Difference]: Start difference. First 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) Second operand 73 states. [2022-04-27 16:13:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:54,015 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 16:13:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 16:13:54,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:54,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:54,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:54,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:54,016 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-04-27 16:13:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-27 16:13:54,017 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-04-27 16:13:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:54,017 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-27 16:13:54,018 INFO L496 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-04-27 16:13:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 16:13:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 16:13:54,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:54,018 INFO L195 NwaCegarLoop]: 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-04-27 16:13:54,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 16:13:54,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1366093938, now seen corresponding path program 1 times [2022-04-27 16:13:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:54,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705551610] [2022-04-27 16:13:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1612#true} is VALID [2022-04-27 16:13:54,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1612#true} {1612#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:13:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 16:13:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 16:13:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 16:13:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 16:13:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 16:13:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 16:13:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 16:13:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {1612#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:54,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1612#true} is VALID [2022-04-27 16:13:54,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1612#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {1612#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {1612#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {1612#true} is VALID [2022-04-27 16:13:54,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {1612#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {1617#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1617#(<= (+ main_~limit~0 4) main_~bufsize~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1617#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {1617#(<= (+ main_~limit~0 4) main_~bufsize~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,154 INFO L272 TraceCheckUtils]: 10: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1612#true} is VALID [2022-04-27 16:13:54,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,155 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,155 INFO L272 TraceCheckUtils]: 15: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1612#true} is VALID [2022-04-27 16:13:54,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,156 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [152] L38-->L39: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_#t~nondet3=|v_main_#t~nondet3_1|} OutVars{main_#t~nondet3=|v_main_#t~nondet3_1|} AuxVars[] AssignedVars[] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [157] L39-->L40: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,157 INFO L272 TraceCheckUtils]: 22: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [162] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1612#true} is VALID [2022-04-27 16:13:54,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,178 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,178 INFO L272 TraceCheckUtils]: 27: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [164] L40-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1612#true} is VALID [2022-04-27 16:13:54,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,179 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,179 INFO L272 TraceCheckUtils]: 32: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [165] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1612#true} is VALID [2022-04-27 16:13:54,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,180 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,180 INFO L272 TraceCheckUtils]: 37: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [166] L42-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1612#true} is VALID [2022-04-27 16:13:54,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,180 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1612#true} {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {1618#(<= (+ 5 main_~j~0) main_~bufsize~0)} [167] L43-->L46: Formula: (and (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) (= v_main_~j~0_11 (+ v_main_~j~0_12 1))) InVars {main_~i~0=v_main_~i~0_16, main_~j~0=v_main_~j~0_12} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_11} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post4, main_#t~post5] {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,181 INFO L272 TraceCheckUtils]: 43: Hoare triple {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [174] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1612#true} is VALID [2022-04-27 16:13:54,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,182 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {1612#true} {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,182 INFO L272 TraceCheckUtils]: 48: Hoare triple {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [168] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1612#true} is VALID [2022-04-27 16:13:54,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {1612#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1612#true} is VALID [2022-04-27 16:13:54,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {1612#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {1612#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1612#true} is VALID [2022-04-27 16:13:54,183 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1612#true} {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,183 INFO L272 TraceCheckUtils]: 53: Hoare triple {1643#(<= (+ main_~j~0 4) main_~bufsize~0)} [169] L47-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:54,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {1652#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1653#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:54,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {1653#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1613#false} is VALID [2022-04-27 16:13:54,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {1613#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1613#false} is VALID [2022-04-27 16:13:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 16:13:54,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:54,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705551610] [2022-04-27 16:13:54,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705551610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:54,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:54,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:13:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647475436] [2022-04-27 16:13:54,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:54,185 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-04-27 16:13:54,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:54,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:54,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:54,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:13:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:13:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:13:54,208 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-04-27 16:13:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:54,738 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 16:13:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:13:54,739 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-04-27 16:13:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-27 16:13:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-27 16:13:54,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-04-27 16:13:54,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:54,806 INFO L225 Difference]: With dead ends: 73 [2022-04-27 16:13:54,806 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 16:13:54,806 INFO L412 NwaCegarLoop]: 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-04-27 16:13:54,807 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:54,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 59 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:13:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 16:13:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-27 16:13:54,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:54,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second 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-04-27 16:13:54,812 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second 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-04-27 16:13:54,812 INFO L87 Difference]: Start difference. First operand 73 states. Second 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-04-27 16:13:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:54,815 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 16:13:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-27 16:13:54,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:54,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:54,815 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 73 states. [2022-04-27 16:13:54,816 INFO L87 Difference]: Start difference. First 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) Second operand 73 states. [2022-04-27 16:13:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:54,818 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-27 16:13:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-27 16:13:54,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:54,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:54,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:54,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:54,819 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-04-27 16:13:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-27 16:13:54,821 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-04-27 16:13:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:54,822 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-27 16:13:54,822 INFO L496 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-04-27 16:13:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-27 16:13:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 16:13:54,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:54,823 INFO L195 NwaCegarLoop]: 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-04-27 16:13:54,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 16:13:54,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:13:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -430516171, now seen corresponding path program 1 times [2022-04-27 16:13:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032086297] [2022-04-27 16:13:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {2011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1960#true} is VALID [2022-04-27 16:13:54,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1960#true} {1960#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:13:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 16:13:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 16:13:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 16:13:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-27 16:13:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 16:13:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 16:13:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 16:13:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 16:13:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [186] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-27 16:13:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:54,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [187] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 v_main_~j~0_24) 1 0)) InVars {main_~j~0=v_main_~j~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {1960#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:13:54,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1960#true} is VALID [2022-04-27 16:13:54,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {1960#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {1960#true} is VALID [2022-04-27 16:13:54,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {1960#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {1965#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {1965#(<= (+ main_~limit~0 4) main_~bufsize~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1965#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {1965#(<= (+ main_~limit~0 4) main_~bufsize~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,964 INFO L272 TraceCheckUtils]: 10: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1960#true} is VALID [2022-04-27 16:13:54,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,965 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,965 INFO L272 TraceCheckUtils]: 15: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1960#true} is VALID [2022-04-27 16:13:54,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,966 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [152] L38-->L39: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_#t~nondet3=|v_main_#t~nondet3_1|} OutVars{main_#t~nondet3=|v_main_#t~nondet3_1|} AuxVars[] AssignedVars[] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [157] L39-->L40: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,966 INFO L272 TraceCheckUtils]: 22: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [162] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1960#true} is VALID [2022-04-27 16:13:54,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,967 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,967 INFO L272 TraceCheckUtils]: 27: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [164] L40-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1960#true} is VALID [2022-04-27 16:13:54,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,968 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,968 INFO L272 TraceCheckUtils]: 32: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [165] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1960#true} is VALID [2022-04-27 16:13:54,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,969 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,969 INFO L272 TraceCheckUtils]: 37: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [166] L42-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1960#true} is VALID [2022-04-27 16:13:54,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,969 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1960#true} {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {1966#(<= (+ 5 main_~j~0) main_~bufsize~0)} [167] L43-->L46: Formula: (and (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) (= v_main_~j~0_11 (+ v_main_~j~0_12 1))) InVars {main_~i~0=v_main_~i~0_16, main_~j~0=v_main_~j~0_12} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_11} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post4, main_#t~post5] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,970 INFO L272 TraceCheckUtils]: 43: Hoare triple {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [174] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1960#true} is VALID [2022-04-27 16:13:54,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,971 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,971 INFO L272 TraceCheckUtils]: 48: Hoare triple {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [168] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1960#true} is VALID [2022-04-27 16:13:54,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,971 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,972 INFO L272 TraceCheckUtils]: 53: Hoare triple {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [169] L47-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1960#true} is VALID [2022-04-27 16:13:54,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,972 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [186] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,972 INFO L272 TraceCheckUtils]: 58: Hoare triple {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [170] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 v_main_~j~0_24) 1 0)) InVars {main_~j~0=v_main_~j~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1960#true} is VALID [2022-04-27 16:13:54,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {1960#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1960#true} is VALID [2022-04-27 16:13:54,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {1960#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {1960#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1960#true} is VALID [2022-04-27 16:13:54,973 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {1960#true} {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [187] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 v_main_~j~0_24) 1 0)) InVars {main_~j~0=v_main_~j~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {1991#(<= (+ main_~j~0 4) main_~bufsize~0)} [171] L49-->L52: Formula: (and (= v_main_~i~0_19 (+ v_main_~i~0_20 1)) (= v_main_~j~0_15 (+ v_main_~j~0_16 1))) InVars {main_~i~0=v_main_~i~0_20, main_~j~0=v_main_~j~0_16} OutVars{main_~i~0=v_main_~i~0_19, main_#t~post6=|v_main_#t~post6_1|, main_~j~0=v_main_~j~0_15, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post6, main_#t~post7] {2008#(<= (+ main_~j~0 3) main_~bufsize~0)} is VALID [2022-04-27 16:13:54,974 INFO L272 TraceCheckUtils]: 64: Hoare triple {2008#(<= (+ main_~j~0 3) main_~bufsize~0)} [175] L52-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_25 v_main_~bufsize~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~bufsize~0=v_main_~bufsize~0_12, main_~j~0=v_main_~j~0_25} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2009#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:13:54,974 INFO L290 TraceCheckUtils]: 65: Hoare triple {2009#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2010#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:13:54,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {2010#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1961#false} is VALID [2022-04-27 16:13:54,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {1961#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1961#false} is VALID [2022-04-27 16:13:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 16:13:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:54,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032086297] [2022-04-27 16:13:54,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032086297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:54,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:54,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 16:13:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033333756] [2022-04-27 16:13:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:54,976 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-04-27 16:13:54,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:54,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-27 16:13:55,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:55,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 16:13:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 16:13:55,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:13:55,002 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-04-27 16:13:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:55,623 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-27 16:13:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:13:55,623 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-04-27 16:13:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-27 16:13:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-27 16:13:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-27 16:13:55,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-27 16:13:55,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:55,683 INFO L225 Difference]: With dead ends: 71 [2022-04-27 16:13:55,683 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:13:55,684 INFO L412 NwaCegarLoop]: 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-04-27 16:13:55,684 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:55,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 66 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:13:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:13:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:13:55,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:55,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-04-27 16:13:55,685 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-04-27 16:13:55,685 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-04-27 16:13:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:55,685 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:13:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:13:55,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:55,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:55,685 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-27 16:13:55,685 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-27 16:13:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:55,685 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:13:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:13:55,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:55,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:55,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:55,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:55,686 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-04-27 16:13:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:13:55,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-04-27 16:13:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:55,686 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:13:55,686 INFO L496 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-04-27 16:13:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:13:55,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:55,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:13:55,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 16:13:55,691 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:55,692 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:13:55,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:13:55 BasicIcfg [2022-04-27 16:13:55,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:13:55,694 INFO L158 Benchmark]: Toolchain (without parser) took 6590.85ms. Allocated memory was 174.1MB in the beginning and 277.9MB in the end (delta: 103.8MB). Free memory was 117.1MB in the beginning and 106.5MB in the end (delta: 10.6MB). Peak memory consumption was 114.8MB. Max. memory is 8.0GB. [2022-04-27 16:13:55,694 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 133.7MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:13:55,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.15ms. Allocated memory was 174.1MB in the beginning and 277.9MB in the end (delta: 103.8MB). Free memory was 116.9MB in the beginning and 252.3MB in the end (delta: -135.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-27 16:13:55,695 INFO L158 Benchmark]: Boogie Preprocessor took 47.43ms. Allocated memory is still 277.9MB. Free memory was 252.3MB in the beginning and 250.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:13:55,695 INFO L158 Benchmark]: RCFGBuilder took 296.95ms. Allocated memory is still 277.9MB. Free memory was 250.2MB in the beginning and 233.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 16:13:55,695 INFO L158 Benchmark]: IcfgTransformer took 63.71ms. Allocated memory is still 277.9MB. Free memory was 233.9MB in the beginning and 231.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:13:55,695 INFO L158 Benchmark]: TraceAbstraction took 5972.42ms. Allocated memory is still 277.9MB. Free memory was 231.3MB in the beginning and 106.5MB in the end (delta: 124.8MB). Peak memory consumption was 125.9MB. Max. memory is 8.0GB. [2022-04-27 16:13:55,696 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 133.7MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.15ms. Allocated memory was 174.1MB in the beginning and 277.9MB in the end (delta: 103.8MB). Free memory was 116.9MB in the beginning and 252.3MB in the end (delta: -135.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.43ms. Allocated memory is still 277.9MB. Free memory was 252.3MB in the beginning and 250.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 296.95ms. Allocated memory is still 277.9MB. Free memory was 250.2MB in the beginning and 233.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 63.71ms. Allocated memory is still 277.9MB. Free memory was 233.9MB in the beginning and 231.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5972.42ms. Allocated memory is still 277.9MB. Free memory was 231.3MB in the beginning and 106.5MB in the end (delta: 124.8MB). Peak memory consumption was 125.9MB. 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 4 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 464 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1512 IncrementalHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 294 mSDtfsCounter, 1512 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: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:13:55,734 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...