/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:16:44,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:16:44,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:16:44,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:16:44,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:16:44,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:16:44,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:16:44,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:16:44,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:16:44,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:16:44,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:16:44,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:16:44,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:16:44,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:16:44,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:16:44,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:16:44,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:16:44,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:16:44,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:16:44,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:16:44,579 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:16:44,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:16:44,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:16:44,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:16:44,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:16:44,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:16:44,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:16:44,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:16:44,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:16:44,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:16:44,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:16:44,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:16:44,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:16:44,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:16:44,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:16:44,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:16:44,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:16:44,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:16:44,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:16:44,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:16:44,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:16:44,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:16:44,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:16:44,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:16:44,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:16:44,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:16:44,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:16:44,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:16:44,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:16:44,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:16:44,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:16:44,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:16:44,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:16:44,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:16:44,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:16:44,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:16:44,615 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:16:44,615 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:16:44,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:16:44,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:16:44,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:16:44,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:16:44,807 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:16:44,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-27 16:16:44,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd23065bd/b2a8ea853c28486ca16f0007562a2100/FLAG0dac77534 [2022-04-27 16:16:45,169 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:16:45,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-27 16:16:45,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd23065bd/b2a8ea853c28486ca16f0007562a2100/FLAG0dac77534 [2022-04-27 16:16:45,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd23065bd/b2a8ea853c28486ca16f0007562a2100 [2022-04-27 16:16:45,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:16:45,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:16:45,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:16:45,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:16:45,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:16:45,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e2bb72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45, skipping insertion in model container [2022-04-27 16:16:45,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:16:45,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:16:45,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i[893,906] [2022-04-27 16:16:45,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:16:45,782 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:16:45,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i[893,906] [2022-04-27 16:16:45,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:16:45,820 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:16:45,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45 WrapperNode [2022-04-27 16:16:45,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:16:45,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:16:45,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:16:45,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:16:45,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:16:45,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:16:45,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:16:45,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:16:45,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:16:45,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:45,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:16:45,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:16:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:16:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:16:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:16:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:16:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:16:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:16:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:16:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:16:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:16:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:16:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:16:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:16:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:16:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:16:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:16:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:16:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:16:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:16:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:16:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:16:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:16:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:16:45,970 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:16:45,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:16:46,233 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:16:46,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:16:46,238 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 16:16:46,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:46 BoogieIcfgContainer [2022-04-27 16:16:46,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:16:46,240 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:16:46,240 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:16:46,241 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:16:46,249 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,250 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:16:46,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:46 BasicIcfg [2022-04-27 16:16:46,302 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:16:46,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:16:46,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:16:46,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:16:46,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:16:45" (1/4) ... [2022-04-27 16:16:46,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b707cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:46, skipping insertion in model container [2022-04-27 16:16:46,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45" (2/4) ... [2022-04-27 16:16:46,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b707cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:46, skipping insertion in model container [2022-04-27 16:16:46,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:46" (3/4) ... [2022-04-27 16:16:46,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b707cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:46, skipping insertion in model container [2022-04-27 16:16:46,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:46" (4/4) ... [2022-04-27 16:16:46,308 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.iJordan [2022-04-27 16:16:46,317 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:16:46,318 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:16:46,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:16:46,363 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54698dca, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2317f1a3 [2022-04-27 16:16:46,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:16:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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-27 16:16:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 16:16:46,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:46,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:46,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash -340968139, now seen corresponding path program 1 times [2022-04-27 16:16:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:46,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217950363] [2022-04-27 16:16:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:46,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 16:16:46,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:46,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 16:16:46,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {32#true} is VALID [2022-04-27 16:16:46,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 16:16:46,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {37#(= main_~i~0 0)} is VALID [2022-04-27 16:16:46,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:46,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:46,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:46,707 INFO L272 TraceCheckUtils]: 14: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:46,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:46,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 16:16:46,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 16:16:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:46,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217950363] [2022-04-27 16:16:46,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217950363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:46,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:46,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:16:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441648454] [2022-04-27 16:16:46,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:46,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-27 16:16:46,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:46,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:46,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:46,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:16:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:46,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:16:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:16:46,763 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:47,210 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-27 16:16:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:16:47,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-27 16:16:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 16:16:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 16:16:47,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-27 16:16:47,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:47,292 INFO L225 Difference]: With dead ends: 49 [2022-04-27 16:16:47,292 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 16:16:47,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:16:47,296 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:47,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:16:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 16:16:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-27 16:16:47,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:47,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:47,316 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:47,316 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:47,319 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 16:16:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 16:16:47,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:47,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:47,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 16:16:47,320 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 16:16:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:47,323 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 16:16:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 16:16:47,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:47,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:47,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:47,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-27 16:16:47,326 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-27 16:16:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:47,326 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-27 16:16:47,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-27 16:16:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 16:16:47,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:47,327 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:47,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:16:47,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1058544685, now seen corresponding path program 1 times [2022-04-27 16:16:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:47,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513992662] [2022-04-27 16:16:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:47,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {224#true} is VALID [2022-04-27 16:16:47,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:47,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {224#true} is VALID [2022-04-27 16:16:47,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {224#true} is VALID [2022-04-27 16:16:47,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {229#(= main_~i~0 0)} is VALID [2022-04-27 16:16:47,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {230#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:47,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {230#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:47,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {230#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {231#(<= 1 main_~n~0)} is VALID [2022-04-27 16:16:47,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 main_~n~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {232#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:47,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {232#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:47,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {232#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {233#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:47,451 INFO L272 TraceCheckUtils]: 17: Hoare triple {233#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:47,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:47,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-27 16:16:47,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {225#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-27 16:16:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513992662] [2022-04-27 16:16:47,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513992662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946690012] [2022-04-27 16:16:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:47,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:47,468 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-27 16:16:47,469 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-27 16:16:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:47,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:16:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:47,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:47,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {224#true} is VALID [2022-04-27 16:16:47,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {224#true} is VALID [2022-04-27 16:16:47,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-27 16:16:47,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {270#(<= 0 main_~i~0)} is VALID [2022-04-27 16:16:47,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#(<= 0 main_~i~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {270#(<= 0 main_~i~0)} is VALID [2022-04-27 16:16:47,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#(<= 0 main_~i~0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {270#(<= 0 main_~i~0)} is VALID [2022-04-27 16:16:47,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#(<= 0 main_~i~0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {280#(<= 1 main_~i~0)} is VALID [2022-04-27 16:16:47,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {280#(<= 1 main_~i~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {284#(and (< main_~i~0 main_~n~0) (<= 1 main_~i~0))} is VALID [2022-04-27 16:16:47,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {284#(and (< main_~i~0 main_~n~0) (<= 1 main_~i~0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {288#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-27 16:16:47,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {288#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {288#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-27 16:16:47,986 INFO L272 TraceCheckUtils]: 17: Hoare triple {288#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:47,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#(<= 1 |__VERIFIER_assert_#in~cond|)} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:47,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {299#(<= 1 __VERIFIER_assert_~cond)} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-27 16:16:47,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {225#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-27 16:16:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:47,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:16:47,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946690012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:47,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:16:47,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-27 16:16:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100079797] [2022-04-27 16:16:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:47,993 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, (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 21 [2022-04-27 16:16:47,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:47,993 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, (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-27 16:16:48,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:48,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:16:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:16:48,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:16:48,007 INFO L87 Difference]: Start difference. First operand 36 states and 42 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, (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-27 16:16:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,198 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 16:16:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:16:48,198 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, (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 21 [2022-04-27 16:16:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:48,199 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, (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-27 16:16:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 16:16:48,200 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, (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-27 16:16:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 16:16:48,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-27 16:16:48,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:48,236 INFO L225 Difference]: With dead ends: 47 [2022-04-27 16:16:48,236 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 16:16:48,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-27 16:16:48,237 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:48,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 117 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:16:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 16:16:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-04-27 16:16:48,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:48,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,240 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,251 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,253 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 16:16:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 16:16:48,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-27 16:16:48,254 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-27 16:16:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,256 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 16:16:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 16:16:48,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:48,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-27 16:16:48,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-04-27 16:16:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:48,261 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-27 16:16:48,261 INFO L496 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, (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-27 16:16:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 16:16:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 16:16:48,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:48,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:48,282 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-27 16:16:48,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:48,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1484070290, now seen corresponding path program 1 times [2022-04-27 16:16:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419591828] [2022-04-27 16:16:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {493#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {478#true} is VALID [2022-04-27 16:16:48,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 16:16:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {478#true} is VALID [2022-04-27 16:16:48,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:48,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {478#true} is VALID [2022-04-27 16:16:48,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {478#true} is VALID [2022-04-27 16:16:48,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {478#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {478#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {478#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {483#(= main_~i~0 0)} is VALID [2022-04-27 16:16:48,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {484#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,567 INFO L272 TraceCheckUtils]: 14: Hoare triple {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {478#true} is VALID [2022-04-27 16:16:48,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {478#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {478#true} is VALID [2022-04-27 16:16:48,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {478#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,571 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {478#true} {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {490#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {490#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {490#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 16:16:48,573 INFO L272 TraceCheckUtils]: 21: Hoare triple {490#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:48,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {491#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {492#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:48,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {492#(not (= __VERIFIER_assert_~cond 0))} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {479#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419591828] [2022-04-27 16:16:48,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419591828] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:48,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653725028] [2022-04-27 16:16:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:48,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:48,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:48,576 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-27 16:16:48,577 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-27 16:16:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 16:16:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:48,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {478#true} is VALID [2022-04-27 16:16:48,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {478#true} is VALID [2022-04-27 16:16:48,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {478#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {478#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {478#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-27 16:16:48,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {527#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:48,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#(<= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {531#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} is VALID [2022-04-27 16:16:48,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {531#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {479#false} is VALID [2022-04-27 16:16:48,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,699 INFO L272 TraceCheckUtils]: 14: Hoare triple {479#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {479#false} is VALID [2022-04-27 16:16:48,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {479#false} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {479#false} is VALID [2022-04-27 16:16:48,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {479#false} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#false} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,700 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {479#false} {479#false} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {479#false} is VALID [2022-04-27 16:16:48,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {479#false} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {479#false} is VALID [2022-04-27 16:16:48,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {479#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,701 INFO L272 TraceCheckUtils]: 21: Hoare triple {479#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {479#false} is VALID [2022-04-27 16:16:48,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {479#false} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {479#false} is VALID [2022-04-27 16:16:48,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {479#false} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {479#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-27 16:16:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:16:48,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:16:48,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653725028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:48,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:16:48,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-04-27 16:16:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644759366] [2022-04-27 16:16:48,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 16:16:48,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:48,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:48,727 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-27 16:16:48,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:16:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:16:48,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:16:48,728 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,756 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 16:16:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:16:48,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 16:16:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 16:16:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 16:16:48,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-27 16:16:48,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:48,778 INFO L225 Difference]: With dead ends: 33 [2022-04-27 16:16:48,779 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 16:16:48,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:16:48,782 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:48,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:16:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 16:16:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 16:16:48,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:48,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,791 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,792 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,794 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 16:16:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 16:16:48,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 16:16:48,796 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 16:16:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,798 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 16:16:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 16:16:48,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:48,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 16:16:48,800 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-27 16:16:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:48,800 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 16:16:48,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 16:16:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 16:16:48,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:48,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:48,830 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-27 16:16:49,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 16:16:49,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 551024538, now seen corresponding path program 1 times [2022-04-27 16:16:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:49,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728980792] [2022-04-27 16:16:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:49,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {701#true} is VALID [2022-04-27 16:16:49,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {701#true} {701#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 16:16:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:49,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {701#true} is VALID [2022-04-27 16:16:49,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {709#(<= main_~j~0 (+ main_~k~0 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {701#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {706#(= main_~i~0 0)} is VALID [2022-04-27 16:16:49,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {706#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {706#(= main_~i~0 0)} is VALID [2022-04-27 16:16:49,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {706#(= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {706#(= main_~i~0 0)} is VALID [2022-04-27 16:16:49,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#(= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {707#(<= main_~i~0 1)} is VALID [2022-04-27 16:16:49,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#(<= main_~i~0 1)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {708#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:49,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#(<= main_~j~0 (+ main_~i~0 1))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#(<= main_~j~0 (+ main_~k~0 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,111 INFO L272 TraceCheckUtils]: 17: Hoare triple {709#(<= main_~j~0 (+ main_~k~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {701#true} is VALID [2022-04-27 16:16:49,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {701#true} is VALID [2022-04-27 16:16:49,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {701#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {701#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,112 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {701#true} {709#(<= main_~j~0 (+ main_~k~0 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {709#(<= main_~j~0 (+ main_~k~0 1))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {714#(<= main_~j~0 main_~k~0)} is VALID [2022-04-27 16:16:49,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {714#(<= main_~j~0 main_~k~0)} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,113 INFO L272 TraceCheckUtils]: 24: Hoare triple {702#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {702#false} is VALID [2022-04-27 16:16:49,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {702#false} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {702#false} is VALID [2022-04-27 16:16:49,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {702#false} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {702#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:49,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728980792] [2022-04-27 16:16:49,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728980792] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827326329] [2022-04-27 16:16:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:49,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:49,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:49,118 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-27 16:16:49,120 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-27 16:16:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:49,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 16:16:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:49,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:49,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {701#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {749#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:49,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {749#(<= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {749#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:49,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#(<= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {749#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:49,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {749#(<= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {707#(<= main_~i~0 1)} is VALID [2022-04-27 16:16:49,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#(<= main_~i~0 1)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {762#(and (<= main_~j~0 (* main_~i~0 2)) (<= main_~i~0 1))} is VALID [2022-04-27 16:16:49,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {762#(and (<= main_~j~0 (* main_~i~0 2)) (<= main_~i~0 1))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-27 16:16:49,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-27 16:16:49,716 INFO L272 TraceCheckUtils]: 17: Hoare triple {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {701#true} is VALID [2022-04-27 16:16:49,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {701#true} is VALID [2022-04-27 16:16:49,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {701#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {701#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,716 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {701#true} {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-27 16:16:49,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {766#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {788#(and (<= (+ (div (* (- 1) main_~j~0) (- 2)) 1) main_~k~0) (<= (div (- main_~j~0) (- 2)) 1))} is VALID [2022-04-27 16:16:49,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {788#(and (<= (+ (div (* (- 1) main_~j~0) (- 2)) 1) main_~k~0) (<= (div (- main_~j~0) (- 2)) 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,718 INFO L272 TraceCheckUtils]: 24: Hoare triple {702#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {702#false} is VALID [2022-04-27 16:16:49,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {702#false} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {702#false} is VALID [2022-04-27 16:16:49,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {702#false} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {702#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:49,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:49,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {702#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {702#false} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {702#false} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {702#false} is VALID [2022-04-27 16:16:49,812 INFO L272 TraceCheckUtils]: 24: Hoare triple {702#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {702#false} is VALID [2022-04-27 16:16:49,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {714#(<= main_~j~0 main_~k~0)} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {702#false} is VALID [2022-04-27 16:16:49,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {709#(<= main_~j~0 (+ main_~k~0 1))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {714#(<= main_~j~0 main_~k~0)} is VALID [2022-04-27 16:16:49,815 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {701#true} {709#(<= main_~j~0 (+ main_~k~0 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {701#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {701#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {701#true} is VALID [2022-04-27 16:16:49,816 INFO L272 TraceCheckUtils]: 17: Hoare triple {709#(<= main_~j~0 (+ main_~k~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {701#true} is VALID [2022-04-27 16:16:49,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#(<= main_~j~0 (+ main_~k~0 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#(<= main_~j~0 (+ main_~i~0 1))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {709#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-27 16:16:49,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#(<= main_~i~0 1)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {708#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-27 16:16:49,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {749#(<= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {707#(<= main_~i~0 1)} is VALID [2022-04-27 16:16:49,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#(<= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {749#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:49,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {749#(<= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {749#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {749#(<= main_~i~0 0)} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {701#true} is VALID [2022-04-27 16:16:49,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {701#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-27 16:16:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:49,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827326329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:49,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:49,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 16:16:49,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817867427] [2022-04-27 16:16:49,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-27 16:16:49,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:49,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:49,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 16:16:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 16:16:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:16:49,848 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,325 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 16:16:50,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:16:50,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-27 16:16:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-27 16:16:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-27 16:16:50,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-27 16:16:50,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:50,372 INFO L225 Difference]: With dead ends: 47 [2022-04-27 16:16:50,372 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 16:16:50,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-04-27 16:16:50,373 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:50,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 45 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:16:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 16:16:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-27 16:16:50,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:50,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,376 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,376 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,378 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 16:16:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 16:16:50,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:50,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:50,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-27 16:16:50,378 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-27 16:16:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,380 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 16:16:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 16:16:50,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:50,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:50,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:50,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-04-27 16:16:50,382 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2022-04-27 16:16:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:50,382 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-04-27 16:16:50,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 16:16:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 16:16:50,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:50,383 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:50,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 16:16:50,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:50,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1358482081, now seen corresponding path program 1 times [2022-04-27 16:16:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:50,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064133603] [2022-04-27 16:16:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1100#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1089#true} is VALID [2022-04-27 16:16:50,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1089#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1089#true} {1089#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 16:16:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {1089#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1089#true} is VALID [2022-04-27 16:16:50,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1089#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1089#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1090#false} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1090#false} is VALID [2022-04-27 16:16:50,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {1089#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:50,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1089#true} is VALID [2022-04-27 16:16:50,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {1089#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1089#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {1089#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {1089#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1089#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1089#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {1089#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1089#true} is VALID [2022-04-27 16:16:50,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1089#true} is VALID [2022-04-27 16:16:50,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1089#true} is VALID [2022-04-27 16:16:50,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {1089#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1094#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#(<= (* main_~i~0 2) main_~j~0)} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1095#(<= (+ main_~k~0 1) main_~j~0)} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {1095#(<= (+ main_~k~0 1) main_~j~0)} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1090#false} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {1090#false} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1090#false} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {1090#false} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1090#false} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {1090#false} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1090#false} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {1090#false} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1090#false} is VALID [2022-04-27 16:16:50,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {1090#false} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1090#false} is VALID [2022-04-27 16:16:50,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {1090#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1090#false} is VALID [2022-04-27 16:16:50,672 INFO L272 TraceCheckUtils]: 23: Hoare triple {1090#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1089#true} is VALID [2022-04-27 16:16:50,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {1089#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1089#true} is VALID [2022-04-27 16:16:50,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1089#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {1089#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-27 16:16:50,672 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1089#true} {1090#false} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1090#false} is VALID [2022-04-27 16:16:50,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {1090#false} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1090#false} is VALID [2022-04-27 16:16:50,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {1090#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1090#false} is VALID [2022-04-27 16:16:50,677 INFO L272 TraceCheckUtils]: 30: Hoare triple {1090#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1090#false} is VALID [2022-04-27 16:16:50,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {1090#false} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1090#false} is VALID [2022-04-27 16:16:50,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {1090#false} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1090#false} is VALID [2022-04-27 16:16:50,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {1090#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#false} is VALID [2022-04-27 16:16:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:16:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064133603] [2022-04-27 16:16:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064133603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:50,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:16:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388858594] [2022-04-27 16:16:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-27 16:16:50,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:50,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:50,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:50,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:16:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:16:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:16:50,697 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,791 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 16:16:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:16:50,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-27 16:16:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 16:16:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 16:16:50,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-27 16:16:50,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:50,830 INFO L225 Difference]: With dead ends: 41 [2022-04-27 16:16:50,830 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 16:16:50,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:16:50,831 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:50,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:16:50,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 16:16:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 16:16:50,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:50,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,833 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,833 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,835 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 16:16:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 16:16:50,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:50,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:50,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 16:16:50,835 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-27 16:16:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,837 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 16:16:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 16:16:50,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:50,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:50,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:50,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-27 16:16:50,838 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 34 [2022-04-27 16:16:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:50,838 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-27 16:16:50,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-27 16:16:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 16:16:50,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:50,839 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:50,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:16:50,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1686349908, now seen corresponding path program 2 times [2022-04-27 16:16:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:50,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613262057] [2022-04-27 16:16:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1292#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1272#true} is VALID [2022-04-27 16:16:50,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1272#true} {1272#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 16:16:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:50,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1279#(<= 2 main_~n~0)} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 16:16:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:50,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {1272#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1292#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {1292#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1272#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {1272#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1272#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {1272#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {1272#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {1272#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1277#(= main_~i~0 0)} is VALID [2022-04-27 16:16:50,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1277#(= main_~i~0 0)} is VALID [2022-04-27 16:16:50,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {1277#(= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1277#(= main_~i~0 0)} is VALID [2022-04-27 16:16:50,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1278#(<= 1 main_~i~0)} is VALID [2022-04-27 16:16:50,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {1278#(<= 1 main_~i~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {1279#(<= 2 main_~n~0)} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {1279#(<= 2 main_~n~0)} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,976 INFO L272 TraceCheckUtils]: 17: Hoare triple {1279#(<= 2 main_~n~0)} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:50,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:50,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,976 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1272#true} {1279#(<= 2 main_~n~0)} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {1279#(<= 2 main_~n~0)} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {1279#(<= 2 main_~n~0)} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {1279#(<= 2 main_~n~0)} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {1279#(<= 2 main_~n~0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {1279#(<= 2 main_~n~0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1279#(<= 2 main_~n~0)} is VALID [2022-04-27 16:16:50,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {1279#(<= 2 main_~n~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,979 INFO L272 TraceCheckUtils]: 30: Hoare triple {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:50,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:50,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:50,979 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1272#true} {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {1284#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1289#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:50,981 INFO L272 TraceCheckUtils]: 37: Hoare triple {1289#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1290#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:50,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {1290#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1291#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:50,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {1291#(not (= __VERIFIER_assert_~cond 0))} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1273#false} is VALID [2022-04-27 16:16:50,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {1273#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1273#false} is VALID [2022-04-27 16:16:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 16:16:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613262057] [2022-04-27 16:16:50,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613262057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127932382] [2022-04-27 16:16:50,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:16:50,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:50,989 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-27 16:16:50,990 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-27 16:16:51,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 16:16:51,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:16:51,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 16:16:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:51,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:51,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {1272#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1272#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {1272#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1272#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {1272#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {1272#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {1272#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1272#true} is VALID [2022-04-27 16:16:51,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {1272#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1272#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1272#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {1272#true} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#true} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L272 TraceCheckUtils]: 17: Hoare triple {1272#true} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1272#true} {1272#true} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {1272#true} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {1272#true} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {1272#true} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1272#true} is VALID [2022-04-27 16:16:51,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1272#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1272#true} is VALID [2022-04-27 16:16:51,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {1272#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1377#(< main_~i~0 main_~n~0)} is VALID [2022-04-27 16:16:51,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {1377#(< main_~i~0 main_~n~0)} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 16:16:51,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 16:16:51,320 INFO L272 TraceCheckUtils]: 30: Hoare triple {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:51,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,320 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1272#true} {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 16:16:51,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-27 16:16:51,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {1381#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1406#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-27 16:16:51,322 INFO L272 TraceCheckUtils]: 37: Hoare triple {1406#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1410#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:51,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {1410#(<= 1 |__VERIFIER_assert_#in~cond|)} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1414#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:51,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {1414#(<= 1 __VERIFIER_assert_~cond)} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1273#false} is VALID [2022-04-27 16:16:51,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {1273#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1273#false} is VALID [2022-04-27 16:16:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 16:16:51,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:51,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {1273#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1273#false} is VALID [2022-04-27 16:16:51,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {1414#(<= 1 __VERIFIER_assert_~cond)} [128] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1273#false} is VALID [2022-04-27 16:16:51,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {1410#(<= 1 |__VERIFIER_assert_#in~cond|)} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1414#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:51,506 INFO L272 TraceCheckUtils]: 37: Hoare triple {1430#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1410#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:51,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1430#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:51,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 16:16:51,508 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1272#true} {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 16:16:51,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:51,508 INFO L272 TraceCheckUtils]: 30: Hoare triple {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 16:16:51,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {1459#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1434#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-27 16:16:51,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {1272#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1459#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-27 16:16:51,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1272#true} is VALID [2022-04-27 16:16:51,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {1272#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {1272#true} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {1272#true} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {1272#true} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1272#true} {1272#true} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#true} [127] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L272 TraceCheckUtils]: 17: Hoare triple {1272#true} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#true} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {1272#true} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {1272#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {1272#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {1272#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1272#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1272#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {1272#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {1272#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {1272#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1272#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {1272#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-27 16:16:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 16:16:51,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127932382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:51,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:51,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-04-27 16:16:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411631721] [2022-04-27 16:16:51,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:51,512 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-04-27 16:16:51,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:51,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 16:16:51,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:51,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 16:16:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 16:16:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-27 16:16:51,563 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 16:16:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:52,105 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 16:16:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:16:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-04-27 16:16:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 16:16:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2022-04-27 16:16:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 16:16:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2022-04-27 16:16:52,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2022-04-27 16:16:52,135 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-27 16:16:52,135 INFO L225 Difference]: With dead ends: 40 [2022-04-27 16:16:52,135 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:16:52,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-27 16:16:52,136 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:52,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 65 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:16:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:16:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:16:52,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:52,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:52,137 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:52,137 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:52,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:52,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:52,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:52,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:16:52,138 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:16:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:52,138 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:52,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:52,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:52,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:52,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:16:52,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-04-27 16:16:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:52,138 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:16:52,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 16:16:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:52,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:52,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:16:52,165 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-27 16:16:52,356 WARN L477 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-27 16:16:52,359 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 16:16:52,361 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:16:52,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:52 BasicIcfg [2022-04-27 16:16:52,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:16:52,364 INFO L158 Benchmark]: Toolchain (without parser) took 6768.24ms. Allocated memory was 211.8MB in the beginning and 275.8MB in the end (delta: 64.0MB). Free memory was 160.6MB in the beginning and 137.2MB in the end (delta: 23.4MB). Peak memory consumption was 87.5MB. Max. memory is 8.0GB. [2022-04-27 16:16:52,364 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 211.8MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:16:52,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.35ms. Allocated memory is still 211.8MB. Free memory was 160.5MB in the beginning and 184.4MB in the end (delta: -23.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 16:16:52,365 INFO L158 Benchmark]: Boogie Preprocessor took 48.56ms. Allocated memory is still 211.8MB. Free memory was 184.4MB in the beginning and 182.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:52,365 INFO L158 Benchmark]: RCFGBuilder took 369.01ms. Allocated memory is still 211.8MB. Free memory was 182.7MB in the beginning and 169.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:16:52,365 INFO L158 Benchmark]: IcfgTransformer took 62.68ms. Allocated memory is still 211.8MB. Free memory was 169.8MB in the beginning and 167.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:52,365 INFO L158 Benchmark]: TraceAbstraction took 6059.42ms. Allocated memory was 211.8MB in the beginning and 275.8MB in the end (delta: 64.0MB). Free memory was 166.6MB in the beginning and 137.2MB in the end (delta: 29.4MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. [2022-04-27 16:16:52,367 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 211.8MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.35ms. Allocated memory is still 211.8MB. Free memory was 160.5MB in the beginning and 184.4MB in the end (delta: -23.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.56ms. Allocated memory is still 211.8MB. Free memory was 184.4MB in the beginning and 182.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 369.01ms. Allocated memory is still 211.8MB. Free memory was 182.7MB in the beginning and 169.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 62.68ms. Allocated memory is still 211.8MB. Free memory was 169.8MB in the beginning and 167.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6059.42ms. Allocated memory was 211.8MB in the beginning and 275.8MB in the end (delta: 64.0MB). Free memory was 166.6MB in the beginning and 137.2MB in the end (delta: 29.4MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 659 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 125 mSDtfsCounter, 659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 52, 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, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 282 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 12 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 101/130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:16:52,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...