/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/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:43:24,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:43:24,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:43:24,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:43:24,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:43:24,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:43:24,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:43:24,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:43:24,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:43:24,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:43:24,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:43:24,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:43:24,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:43:24,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:43:24,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:43:24,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:43:24,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:43:24,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:43:24,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:43:24,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:43:24,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:43:24,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:43:24,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:43:24,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:43:24,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:43:24,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:43:24,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:43:24,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:43:24,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:43:24,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:43:24,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:43:24,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:43:24,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:43:24,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:43:24,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:43:24,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:43:24,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:43:24,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:43:24,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:43:24,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:43:24,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:43:24,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:43:24,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:43:24,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:43:24,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:43:24,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:43:24,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:43:24,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:43:24,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:43:24,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:43:24,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:43:24,083 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:43:24,083 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-07 16:43:24,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:43:24,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:43:24,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:43:24,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:43:24,280 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:43:24,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2022-04-07 16:43:24,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfbc4507/ea9dba83fb16444890e30c33d1684645/FLAGdba0bf727 [2022-04-07 16:43:24,668 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:43:24,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2022-04-07 16:43:24,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfbc4507/ea9dba83fb16444890e30c33d1684645/FLAGdba0bf727 [2022-04-07 16:43:25,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfbc4507/ea9dba83fb16444890e30c33d1684645 [2022-04-07 16:43:25,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:43:25,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:43:25,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:43:25,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:43:25,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:43:25,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdb276a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25, skipping insertion in model container [2022-04-07 16:43:25,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:43:25,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:43:25,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i[808,821] [2022-04-07 16:43:25,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:43:25,265 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:43:25,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i[808,821] [2022-04-07 16:43:25,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:43:25,283 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:43:25,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25 WrapperNode [2022-04-07 16:43:25,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:43:25,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:43:25,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:43:25,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:43:25,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:43:25,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:43:25,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:43:25,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:43:25,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:43:25,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:25,330 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-07 16:43:25,344 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-07 16:43:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:43:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:43:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:43:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:43:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:43:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:43:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:43:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:43:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:43:25,406 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:43:25,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:43:25,541 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:43:25,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:43:25,545 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:43:25,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:25 BoogieIcfgContainer [2022-04-07 16:43:25,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:43:25,547 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:43:25,548 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:43:25,561 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:43:25,564 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:25" (1/1) ... [2022-04-07 16:43:25,565 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:43:25,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:43:25 BasicIcfg [2022-04-07 16:43:25,591 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:43:25,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:43:25,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:43:25,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:43:25,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:43:25" (1/4) ... [2022-04-07 16:43:25,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b700e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:43:25, skipping insertion in model container [2022-04-07 16:43:25,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:25" (2/4) ... [2022-04-07 16:43:25,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b700e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:43:25, skipping insertion in model container [2022-04-07 16:43:25,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:25" (3/4) ... [2022-04-07 16:43:25,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b700e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:43:25, skipping insertion in model container [2022-04-07 16:43:25,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:43:25" (4/4) ... [2022-04-07 16:43:25,597 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-2.iJordan [2022-04-07 16:43:25,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:43:25,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:43:25,627 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:43:25,631 INFO L340 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 [2022-04-07 16:43:25,631 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:43:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:43:25,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:25,657 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:25,657 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1795998501, now seen corresponding path program 1 times [2022-04-07 16:43:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:25,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164792248] [2022-04-07 16:43:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:25,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {22#true} is VALID [2022-04-07 16:43:25,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:43:25,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:43:25,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:25,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {22#true} is VALID [2022-04-07 16:43:25,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:43:25,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:43:25,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:43:25,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {22#true} is VALID [2022-04-07 16:43:25,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [51] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 16:43:25,835 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {23#false} is VALID [2022-04-07 16:43:25,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-07 16:43:25,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [58] L15-->L16: Formula: (= 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[] {23#false} is VALID [2022-04-07 16:43:25,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 16:43:25,836 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-07 16:43:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:25,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164792248] [2022-04-07 16:43:25,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164792248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:43:25,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:43:25,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:43:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043081999] [2022-04-07 16:43:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:43:25,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-07 16:43:25,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:25,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 16:43:25,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:25,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:43:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:43:25,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:43:25,884 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 16:43:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:25,926 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-07 16:43:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:43:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-07 16:43:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 16:43:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-07 16:43:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 16:43:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-07 16:43:25,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-04-07 16:43:25,975 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-07 16:43:25,980 INFO L225 Difference]: With dead ends: 19 [2022-04-07 16:43:25,981 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 16:43:25,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:43:25,984 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:25,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 16:43:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 16:43:26,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:26,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 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-07 16:43:26,002 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 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-07 16:43:26,002 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 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-07 16:43:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,004 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 16:43:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 16:43:26,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:26,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:26,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 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) Second operand 13 states. [2022-04-07 16:43:26,005 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 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) Second operand 13 states. [2022-04-07 16:43:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,007 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 16:43:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 16:43:26,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:26,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:26,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:26,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 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-07 16:43:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 16:43:26,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-07 16:43:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:26,010 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 16:43:26,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 16:43:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 16:43:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:43:26,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:26,010 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:26,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:43:26,011 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1796922022, now seen corresponding path program 1 times [2022-04-07 16:43:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:26,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480885444] [2022-04-07 16:43:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {88#true} is VALID [2022-04-07 16:43:26,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:43:26,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88#true} {88#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:43:26,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {88#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:26,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {88#true} is VALID [2022-04-07 16:43:26,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:43:26,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88#true} {88#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:43:26,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:43:26,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {93#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:26,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {93#(= (+ (- 1) main_~i~0) 0)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-07 16:43:26,070 INFO L272 TraceCheckUtils]: 7: Hoare triple {89#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {89#false} is VALID [2022-04-07 16:43:26,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {89#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {89#false} is VALID [2022-04-07 16:43:26,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {89#false} [58] L15-->L16: Formula: (= 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[] {89#false} is VALID [2022-04-07 16:43:26,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-07 16:43:26,071 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-07 16:43:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:26,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480885444] [2022-04-07 16:43:26,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480885444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:43:26,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:43:26,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:43:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221058082] [2022-04-07 16:43:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:43:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-07 16:43:26,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:26,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-07 16:43:26,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:26,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:43:26,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:26,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:43:26,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:43:26,089 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-07 16:43:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,128 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 16:43:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:43:26,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-07 16:43:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-07 16:43:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-07 16:43:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-07 16:43:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-07 16:43:26,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-04-07 16:43:26,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:26,145 INFO L225 Difference]: With dead ends: 15 [2022-04-07 16:43:26,146 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 16:43:26,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:43:26,147 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:26,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 16:43:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-07 16:43:26,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:26,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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-07 16:43:26,149 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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-07 16:43:26,150 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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-07 16:43:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,151 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 16:43:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 16:43:26,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:26,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:26,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 15 states. [2022-04-07 16:43:26,152 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 15 states. [2022-04-07 16:43:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,159 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 16:43:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 16:43:26,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:26,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:26,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:26,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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-07 16:43:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 16:43:26,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-07 16:43:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:26,164 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 16:43:26,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-07 16:43:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 16:43:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 16:43:26,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:26,164 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:26,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:43:26,165 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1176605188, now seen corresponding path program 1 times [2022-04-07 16:43:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:26,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112944942] [2022-04-07 16:43:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {158#true} is VALID [2022-04-07 16:43:26,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:26,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {158#true} is VALID [2022-04-07 16:43:26,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {163#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:26,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(= (+ (- 1) main_~i~0) 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {163#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:26,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(= (+ (- 1) main_~i~0) 0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {164#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:26,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#(<= main_~i~0 2)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:43:26,229 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {159#false} is VALID [2022-04-07 16:43:26,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {159#false} is VALID [2022-04-07 16:43:26,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [58] L15-->L16: Formula: (= 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[] {159#false} is VALID [2022-04-07 16:43:26,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:43:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112944942] [2022-04-07 16:43:26,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112944942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:26,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315756747] [2022-04-07 16:43:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:26,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:26,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:26,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 16:43:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 16:43:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:26,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [47] 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) 10) (= (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] {158#true} is VALID [2022-04-07 16:43:26,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {184#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:26,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(<= main_~i~0 1)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {184#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:26,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(<= main_~i~0 1)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {164#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:26,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#(<= main_~i~0 2)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:43:26,365 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {159#false} is VALID [2022-04-07 16:43:26,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {159#false} is VALID [2022-04-07 16:43:26,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [58] L15-->L16: Formula: (= 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[] {159#false} is VALID [2022-04-07 16:43:26,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:43:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:26,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:43:26,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:43:26,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [58] L15-->L16: Formula: (= 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[] {159#false} is VALID [2022-04-07 16:43:26,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {159#false} is VALID [2022-04-07 16:43:26,454 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {159#false} is VALID [2022-04-07 16:43:26,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~i~0 8)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:43:26,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {222#(<= main_~i~0 7)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {218#(<= main_~i~0 8)} is VALID [2022-04-07 16:43:26,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(<= main_~i~0 7)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {222#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:26,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {222#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:26,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [47] 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) 10) (= (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] {158#true} is VALID [2022-04-07 16:43:26,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:43:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:26,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315756747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:43:26,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:43:26,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 16:43:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105922936] [2022-04-07 16:43:26,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:43:26,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 16:43:26,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:26,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:26,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:26,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:43:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:43:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:43:26,481 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,568 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 16:43:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 16:43:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 16:43:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-07 16:43:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-07 16:43:26,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-07 16:43:26,593 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-07 16:43:26,595 INFO L225 Difference]: With dead ends: 20 [2022-04-07 16:43:26,596 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 16:43:26,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:43:26,600 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:26,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 16:43:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-07 16:43:26,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:26,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 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-07 16:43:26,605 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 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-07 16:43:26,607 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 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-07 16:43:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,610 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 16:43:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 16:43:26,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:26,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:26,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 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) Second operand 20 states. [2022-04-07 16:43:26,615 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 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) Second operand 20 states. [2022-04-07 16:43:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:26,616 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 16:43:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 16:43:26,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:26,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:26,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:26,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 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-07 16:43:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-07 16:43:26,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2022-04-07 16:43:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:26,624 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-07 16:43:26,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 16:43:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 16:43:26,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:26,625 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:26,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:26,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:26,834 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2042821406, now seen corresponding path program 2 times [2022-04-07 16:43:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:26,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960681971] [2022-04-07 16:43:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {334#true} is VALID [2022-04-07 16:43:26,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:26,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:26,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:26,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {334#true} is VALID [2022-04-07 16:43:26,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:26,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:26,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:26,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {339#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:26,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= (+ (- 1) main_~i~0) 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {339#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:26,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(= (+ (- 1) main_~i~0) 0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {340#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:26,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 2)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {340#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:26,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= main_~i~0 2)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {341#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:26,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#(<= main_~i~0 3)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {341#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:26,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {341#(<= main_~i~0 3)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {342#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:26,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {342#(<= main_~i~0 4)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {342#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:26,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {342#(<= main_~i~0 4)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {343#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:26,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {343#(<= main_~i~0 5)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:43:26,904 INFO L272 TraceCheckUtils]: 15: Hoare triple {335#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {335#false} is VALID [2022-04-07 16:43:26,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {335#false} is VALID [2022-04-07 16:43:26,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} [58] L15-->L16: Formula: (= 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[] {335#false} is VALID [2022-04-07 16:43:26,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:43:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:26,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:26,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960681971] [2022-04-07 16:43:26,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960681971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:26,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657314607] [2022-04-07 16:43:26,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:43:26,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:26,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:26,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:26,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:43:26,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:43:26,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 16:43:26,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 16:43:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:26,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:27,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} [47] 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) 10) (= (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] {334#true} is VALID [2022-04-07 16:43:27,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {363#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:27,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#(<= main_~i~0 1)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {363#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:27,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(<= main_~i~0 1)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {340#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:27,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 2)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {340#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:27,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= main_~i~0 2)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {341#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:27,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#(<= main_~i~0 3)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {341#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:27,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {341#(<= main_~i~0 3)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {342#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:27,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {342#(<= main_~i~0 4)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {342#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:27,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {342#(<= main_~i~0 4)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {343#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:27,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {343#(<= main_~i~0 5)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:43:27,089 INFO L272 TraceCheckUtils]: 15: Hoare triple {335#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {335#false} is VALID [2022-04-07 16:43:27,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {335#false} is VALID [2022-04-07 16:43:27,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} [58] L15-->L16: Formula: (= 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[] {335#false} is VALID [2022-04-07 16:43:27,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:43:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:27,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:43:27,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:43:27,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} [58] L15-->L16: Formula: (= 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[] {335#false} is VALID [2022-04-07 16:43:27,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {335#false} is VALID [2022-04-07 16:43:27,201 INFO L272 TraceCheckUtils]: 15: Hoare triple {335#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {335#false} is VALID [2022-04-07 16:43:27,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {415#(<= main_~i~0 8)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:43:27,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#(<= main_~i~0 7)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {415#(<= main_~i~0 8)} is VALID [2022-04-07 16:43:27,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(<= main_~i~0 7)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {419#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:27,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {426#(<= main_~i~0 6)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {419#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:27,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {426#(<= main_~i~0 6)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {426#(<= main_~i~0 6)} is VALID [2022-04-07 16:43:27,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(<= main_~i~0 5)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {426#(<= main_~i~0 6)} is VALID [2022-04-07 16:43:27,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {343#(<= main_~i~0 5)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {343#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:27,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(<= main_~i~0 4)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {343#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:27,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(<= main_~i~0 4)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {342#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:27,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {342#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:27,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} [47] 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) 10) (= (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] {334#true} is VALID [2022-04-07 16:43:27,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:43:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:27,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657314607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:43:27,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:43:27,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 16:43:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284270120] [2022-04-07 16:43:27,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:43:27,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 16:43:27,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:27,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:27,225 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-07 16:43:27,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 16:43:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 16:43:27,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:43:27,226 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:27,375 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-07 16:43:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 16:43:27,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 16:43:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-07 16:43:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-07 16:43:27,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2022-04-07 16:43:27,403 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-07 16:43:27,404 INFO L225 Difference]: With dead ends: 28 [2022-04-07 16:43:27,404 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 16:43:27,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-07 16:43:27,405 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:27,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 16:43:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 16:43:27,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:27,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 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-07 16:43:27,407 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 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-07 16:43:27,407 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 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-07 16:43:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:27,408 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-07 16:43:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-07 16:43:27,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:27,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:27,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 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) Second operand 28 states. [2022-04-07 16:43:27,409 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 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) Second operand 28 states. [2022-04-07 16:43:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:27,410 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-07 16:43:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-07 16:43:27,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:27,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:27,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:27,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 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-07 16:43:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-07 16:43:27,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2022-04-07 16:43:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:27,412 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-07 16:43:27,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-07 16:43:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 16:43:27,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:27,412 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:27,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:27,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 16:43:27,613 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1851728790, now seen corresponding path program 3 times [2022-04-07 16:43:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:27,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281684425] [2022-04-07 16:43:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:27,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:27,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {590#true} is VALID [2022-04-07 16:43:27,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:27,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {590#true} {590#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:27,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {590#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:27,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {590#true} is VALID [2022-04-07 16:43:27,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {590#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:27,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {590#true} {590#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:27,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {590#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:27,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {590#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {595#(= main_~sn~0 0)} is VALID [2022-04-07 16:43:27,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(= main_~sn~0 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:27,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:27,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 16:43:27,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 16:43:27,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 16:43:27,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 16:43:27,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 16:43:27,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 16:43:27,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 16:43:27,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 16:43:27,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 16:43:27,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 16:43:27,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 16:43:27,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 16:43:27,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 16:43:27,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 16:43:27,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 16:43:27,796 INFO L272 TraceCheckUtils]: 23: Hoare triple {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {604#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:43:27,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {604#(not (= |__VERIFIER_assert_#in~cond| 0))} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {605#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:43:27,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {605#(not (= __VERIFIER_assert_~cond 0))} [58] L15-->L16: Formula: (= 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[] {591#false} is VALID [2022-04-07 16:43:27,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {591#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#false} is VALID [2022-04-07 16:43:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281684425] [2022-04-07 16:43:27,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281684425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989865009] [2022-04-07 16:43:27,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 16:43:27,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:27,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:27,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 16:43:27,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-07 16:43:27,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:43:27,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 16:43:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:27,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:28,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {590#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#true} [47] 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) 10) (= (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] {590#true} is VALID [2022-04-07 16:43:28,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {590#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {590#true} {590#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {590#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {590#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {595#(= main_~sn~0 0)} is VALID [2022-04-07 16:43:28,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(= main_~sn~0 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:28,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:28,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 16:43:28,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 16:43:28,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 16:43:28,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 16:43:28,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 16:43:28,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 16:43:28,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {599#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 16:43:28,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 16:43:28,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {600#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 16:43:28,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 16:43:28,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {601#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 16:43:28,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 16:43:28,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 16:43:28,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 16:43:28,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 16:43:28,170 INFO L272 TraceCheckUtils]: 23: Hoare triple {603#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {679#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:43:28,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(<= 1 |__VERIFIER_assert_#in~cond|)} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {683#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:43:28,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {683#(<= 1 __VERIFIER_assert_~cond)} [58] L15-->L16: Formula: (= 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[] {591#false} is VALID [2022-04-07 16:43:28,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {591#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#false} is VALID [2022-04-07 16:43:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:28,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:43:28,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {591#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#false} is VALID [2022-04-07 16:43:28,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {683#(<= 1 __VERIFIER_assert_~cond)} [58] L15-->L16: Formula: (= 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[] {591#false} is VALID [2022-04-07 16:43:28,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(<= 1 |__VERIFIER_assert_#in~cond|)} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {683#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:43:28,483 INFO L272 TraceCheckUtils]: 23: Hoare triple {699#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {679#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:43:28,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {699#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {699#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-07 16:43:28,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {699#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {699#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-07 16:43:28,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {699#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-07 16:43:28,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {709#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:43:28,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {716#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {709#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:43:28,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 16:43:28,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {716#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 16:43:28,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {723#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {723#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-07 16:43:28,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {723#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-07 16:43:28,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {730#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-07 16:43:28,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {737#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {730#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-07 16:43:28,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {737#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {737#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-07 16:43:28,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {737#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-07 16:43:28,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {744#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {744#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-07 16:43:28,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {751#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {744#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-07 16:43:28,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {751#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {751#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-07 16:43:28,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {758#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {751#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-07 16:43:28,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {590#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {758#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} is VALID [2022-04-07 16:43:28,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {590#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {590#true} {590#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {590#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#true} [47] 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) 10) (= (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] {590#true} is VALID [2022-04-07 16:43:28,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {590#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#true} is VALID [2022-04-07 16:43:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:28,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989865009] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:43:28,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:43:28,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-07 16:43:28,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384063188] [2022-04-07 16:43:28,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:43:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 16:43:28,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:28,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:28,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:28,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-07 16:43:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:28,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-07 16:43:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2022-04-07 16:43:28,533 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:29,153 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-07 16:43:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 16:43:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 16:43:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2022-04-07 16:43:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2022-04-07 16:43:29,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 34 transitions. [2022-04-07 16:43:29,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:29,181 INFO L225 Difference]: With dead ends: 33 [2022-04-07 16:43:29,181 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 16:43:29,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2022-04-07 16:43:29,182 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:29,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 16:43:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 16:43:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-07 16:43:29,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:29,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 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-07 16:43:29,184 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 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-07 16:43:29,184 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 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-07 16:43:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:29,185 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-07 16:43:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-07 16:43:29,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:29,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:29,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 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) Second operand 30 states. [2022-04-07 16:43:29,186 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 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) Second operand 30 states. [2022-04-07 16:43:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:29,187 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-07 16:43:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-07 16:43:29,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:29,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:29,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:29,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 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-07 16:43:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-07 16:43:29,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2022-04-07 16:43:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:29,188 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-07 16:43:29,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-07 16:43:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 16:43:29,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:29,189 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:29,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:29,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:29,400 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1988665612, now seen corresponding path program 4 times [2022-04-07 16:43:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:29,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622744885] [2022-04-07 16:43:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:29,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {924#true} is VALID [2022-04-07 16:43:29,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {924#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {924#true} {924#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {924#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:29,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 10) (= (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] {924#true} is VALID [2022-04-07 16:43:29,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {924#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {924#true} {924#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {924#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {924#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {929#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:29,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#(= (+ (- 1) main_~i~0) 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {929#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:29,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {929#(= (+ (- 1) main_~i~0) 0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {930#(<= 2 main_~i~0)} is VALID [2022-04-07 16:43:29,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(<= 2 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {930#(<= 2 main_~i~0)} is VALID [2022-04-07 16:43:29,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#(<= 2 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {931#(<= 3 main_~i~0)} is VALID [2022-04-07 16:43:29,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(<= 3 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {931#(<= 3 main_~i~0)} is VALID [2022-04-07 16:43:29,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(<= 3 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {932#(<= 4 main_~i~0)} is VALID [2022-04-07 16:43:29,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#(<= 4 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {932#(<= 4 main_~i~0)} is VALID [2022-04-07 16:43:29,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#(<= 4 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {933#(<= 5 main_~i~0)} is VALID [2022-04-07 16:43:29,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(<= 5 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {933#(<= 5 main_~i~0)} is VALID [2022-04-07 16:43:29,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(<= 5 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {934#(<= 6 main_~i~0)} is VALID [2022-04-07 16:43:29,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {934#(<= 6 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {934#(<= 6 main_~i~0)} is VALID [2022-04-07 16:43:29,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {934#(<= 6 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {935#(<= 7 main_~i~0)} is VALID [2022-04-07 16:43:29,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {935#(<= 7 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {935#(<= 7 main_~i~0)} is VALID [2022-04-07 16:43:29,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {935#(<= 7 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {936#(<= 8 main_~i~0)} is VALID [2022-04-07 16:43:29,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {936#(<= 8 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {936#(<= 8 main_~i~0)} is VALID [2022-04-07 16:43:29,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {936#(<= 8 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {937#(<= 9 main_~i~0)} is VALID [2022-04-07 16:43:29,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {937#(<= 9 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {925#false} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {925#false} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L272 TraceCheckUtils]: 25: Hoare triple {925#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {925#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {925#false} [58] L15-->L16: Formula: (= 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[] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {925#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-07 16:43:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622744885] [2022-04-07 16:43:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622744885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200383974] [2022-04-07 16:43:29,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 16:43:29,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:29,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:29,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:29,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 16:43:29,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 16:43:29,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:43:29,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 16:43:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:29,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:29,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {924#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {924#true} [47] 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) 10) (= (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] {924#true} is VALID [2022-04-07 16:43:29,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {924#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {924#true} {924#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {924#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-07 16:43:29,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {924#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {957#(<= 1 main_~i~0)} is VALID [2022-04-07 16:43:29,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {957#(<= 1 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {957#(<= 1 main_~i~0)} is VALID [2022-04-07 16:43:29,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#(<= 1 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {930#(<= 2 main_~i~0)} is VALID [2022-04-07 16:43:29,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(<= 2 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {930#(<= 2 main_~i~0)} is VALID [2022-04-07 16:43:29,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#(<= 2 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {931#(<= 3 main_~i~0)} is VALID [2022-04-07 16:43:29,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(<= 3 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {931#(<= 3 main_~i~0)} is VALID [2022-04-07 16:43:29,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(<= 3 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {932#(<= 4 main_~i~0)} is VALID [2022-04-07 16:43:29,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#(<= 4 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {932#(<= 4 main_~i~0)} is VALID [2022-04-07 16:43:29,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#(<= 4 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {933#(<= 5 main_~i~0)} is VALID [2022-04-07 16:43:29,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(<= 5 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {933#(<= 5 main_~i~0)} is VALID [2022-04-07 16:43:29,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(<= 5 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {934#(<= 6 main_~i~0)} is VALID [2022-04-07 16:43:29,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {934#(<= 6 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {934#(<= 6 main_~i~0)} is VALID [2022-04-07 16:43:29,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {934#(<= 6 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {935#(<= 7 main_~i~0)} is VALID [2022-04-07 16:43:29,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {935#(<= 7 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {935#(<= 7 main_~i~0)} is VALID [2022-04-07 16:43:29,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {935#(<= 7 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {936#(<= 8 main_~i~0)} is VALID [2022-04-07 16:43:29,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {936#(<= 8 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {936#(<= 8 main_~i~0)} is VALID [2022-04-07 16:43:29,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {936#(<= 8 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {937#(<= 9 main_~i~0)} is VALID [2022-04-07 16:43:29,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {937#(<= 9 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {925#false} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {925#false} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L272 TraceCheckUtils]: 25: Hoare triple {925#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {925#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {925#false} [58] L15-->L16: Formula: (= 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[] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {925#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-07 16:43:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:29,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 16:43:29,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200383974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:43:29,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 16:43:29,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 13 [2022-04-07 16:43:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637098775] [2022-04-07 16:43:29,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:43:29,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 29 [2022-04-07 16:43:29,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:29,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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-07 16:43:29,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:29,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 16:43:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 16:43:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-07 16:43:29,709 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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-07 16:43:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:29,760 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-04-07 16:43:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 16:43:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 29 [2022-04-07 16:43:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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-07 16:43:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-07 16:43:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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-07 16:43:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-07 16:43:29,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2022-04-07 16:43:29,776 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-07 16:43:29,776 INFO L225 Difference]: With dead ends: 23 [2022-04-07 16:43:29,776 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 16:43:29,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-07 16:43:29,777 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:29,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 16:43:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 16:43:29,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:29,777 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-07 16:43:29,777 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-07 16:43:29,777 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-07 16:43:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:29,777 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:43:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:43:29,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:29,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:29,778 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-07 16:43:29,778 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-07 16:43:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:29,778 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:43:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:43:29,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:29,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:29,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:29,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:29,778 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-07 16:43:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 16:43:29,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-07 16:43:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:29,778 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 16:43:29,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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-07 16:43:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:43:29,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:29,780 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:43:29,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:29,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:30,002 INFO L719 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-04-07 16:43:30,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:43:30,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:43:30 BasicIcfg [2022-04-07 16:43:30,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:43:30,006 INFO L158 Benchmark]: Toolchain (without parser) took 4903.29ms. Allocated memory was 199.2MB in the beginning and 265.3MB in the end (delta: 66.1MB). Free memory was 144.4MB in the beginning and 101.7MB in the end (delta: 42.7MB). Peak memory consumption was 109.8MB. Max. memory is 8.0GB. [2022-04-07 16:43:30,006 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:43:30,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.76ms. Allocated memory is still 199.2MB. Free memory was 144.2MB in the beginning and 168.8MB in the end (delta: -24.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-07 16:43:30,006 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 199.2MB. Free memory was 168.8MB in the beginning and 167.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:43:30,006 INFO L158 Benchmark]: RCFGBuilder took 240.22ms. Allocated memory is still 199.2MB. Free memory was 167.6MB in the beginning and 157.3MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 16:43:30,006 INFO L158 Benchmark]: IcfgTransformer took 43.69ms. Allocated memory is still 199.2MB. Free memory was 157.3MB in the beginning and 156.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:43:30,007 INFO L158 Benchmark]: TraceAbstraction took 4412.69ms. Allocated memory was 199.2MB in the beginning and 265.3MB in the end (delta: 66.1MB). Free memory was 155.7MB in the beginning and 101.7MB in the end (delta: 54.0MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. [2022-04-07 16:43:30,007 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 199.2MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.76ms. Allocated memory is still 199.2MB. Free memory was 144.2MB in the beginning and 168.8MB in the end (delta: -24.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 199.2MB. Free memory was 168.8MB in the beginning and 167.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 240.22ms. Allocated memory is still 199.2MB. Free memory was 167.6MB in the beginning and 157.3MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 43.69ms. Allocated memory is still 199.2MB. Free memory was 157.3MB in the beginning and 156.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4412.69ms. Allocated memory was 199.2MB in the beginning and 265.3MB in the end (delta: 66.1MB). Free memory was 155.7MB in the beginning and 101.7MB in the end (delta: 54.0MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 75 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 198 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 1 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 147/405 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-07 16:43:30,031 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...