/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-34549b5 [2022-04-07 17:03:24,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:03:24,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:03:24,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:03:24,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:03:24,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:03:24,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:03:24,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:03:24,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:03:24,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:03:24,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:03:24,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:03:24,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:03:24,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:03:24,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:03:24,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:03:24,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:03:24,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:03:24,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:03:24,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:03:24,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:03:24,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:03:24,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:03:24,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:03:24,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:03:24,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:03:24,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:03:24,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:03:24,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:03:24,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:03:24,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:03:24,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:03:24,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:03:24,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:03:24,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:03:24,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:03:24,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:03:24,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:03:24,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:03:24,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:03:24,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:03:24,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:03:24,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:03:24,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:03:24,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:03:24,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:03:24,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:03:24,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:03:24,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:03:24,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:03:24,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:03:24,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:03:24,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:03:24,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:03:24,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:03:24,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:03:24,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:03:24,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:03:24,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:03:24,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:03:24,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:03:24,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:24,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:03:24,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:03:24,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:03:24,911 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 17:03:25,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:03:25,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:03:25,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:03:25,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:03:25,168 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:03:25,169 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-07 17:03:25,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba1b1286/3367a6747146476f91bc22f7a97ba0db/FLAG7904ab193 [2022-04-07 17:03:25,599 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:03:25,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-07 17:03:25,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba1b1286/3367a6747146476f91bc22f7a97ba0db/FLAG7904ab193 [2022-04-07 17:03:25,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba1b1286/3367a6747146476f91bc22f7a97ba0db [2022-04-07 17:03:25,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:03:25,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:03:25,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:25,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:03:25,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:03:25,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39eaa481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25, skipping insertion in model container [2022-04-07 17:03:25,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:03:25,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:03:25,845 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-07 17:03:25,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:25,890 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:03:25,905 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-07 17:03:25,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:25,933 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:03:25,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25 WrapperNode [2022-04-07 17:03:25,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:25,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:03:25,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:03:25,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:03:25,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:03:25,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:03:25,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:03:25,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:03:25,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (1/1) ... [2022-04-07 17:03:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:26,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 17:03:26,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:03:26,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:03:26,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:03:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:03:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:03:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:03:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:03:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:03:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:03:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:03:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:03:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:03:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:03:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:03:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:03:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:03:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:03:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:03:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:03:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:03:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:03:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:03:26,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 17:03:26,156 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:03:26,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:03:26,415 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:03:26,421 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:03:26,421 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 17:03:26,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:26 BoogieIcfgContainer [2022-04-07 17:03:26,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:03:26,423 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:03:26,424 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:03:26,436 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:03:26,440 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:26" (1/1) ... [2022-04-07 17:03:26,443 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:03:26,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:26 BasicIcfg [2022-04-07 17:03:26,504 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:03:26,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:03:26,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:03:26,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:03:26,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:03:25" (1/4) ... [2022-04-07 17:03:26,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ab8864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:26, skipping insertion in model container [2022-04-07 17:03:26,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:25" (2/4) ... [2022-04-07 17:03:26,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ab8864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:26, skipping insertion in model container [2022-04-07 17:03:26,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:26" (3/4) ... [2022-04-07 17:03:26,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ab8864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:26, skipping insertion in model container [2022-04-07 17:03:26,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:26" (4/4) ... [2022-04-07 17:03:26,518 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.iJordan [2022-04-07 17:03:26,524 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:03:26,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:03:26,567 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:03:26,575 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:03:26,575 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:03:26,590 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-07 17:03:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 17:03:26,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:26,598 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:26,598 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash -340968139, now seen corresponding path program 1 times [2022-04-07 17:03:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:26,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753324603] [2022-04-07 17:03:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:26,983 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-07 17:03:26,984 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-07 17:03:26,984 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-07 17:03:26,986 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-07 17:03:26,987 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-07 17:03:26,987 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-07 17:03:26,987 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-07 17:03:26,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 17:03:26,988 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-07 17:03:26,989 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-07 17:03:26,989 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-07 17:03:26,989 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-07 17:03:26,989 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-07 17:03:26,990 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-07 17:03:26,992 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-07 17:03:26,993 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-07 17:03:26,995 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-07 17:03:26,998 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-07 17:03:27,000 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-07 17:03:27,003 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-07 17:03:27,003 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-07 17:03:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753324603] [2022-04-07 17:03:27,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753324603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:27,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:27,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 17:03:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900448696] [2022-04-07 17:03:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:27,016 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-07 17:03:27,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:27,020 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-07 17:03:27,051 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-07 17:03:27,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 17:03:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:27,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 17:03:27,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 17:03:27,080 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-07 17:03:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:27,706 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-07 17:03:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 17:03:27,706 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-07 17:03:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:27,708 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-07 17:03:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-07 17:03:27,718 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-07 17:03:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-07 17:03:27,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-07 17:03:27,809 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-07 17:03:27,821 INFO L225 Difference]: With dead ends: 49 [2022-04-07 17:03:27,822 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 17:03:27,824 INFO L912 BasicCegarLoop]: 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-07 17:03:27,828 INFO L913 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:27,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 17:03:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 17:03:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-07 17:03:27,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:27,856 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-07 17:03:27,857 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-07 17:03:27,858 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-07 17:03:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:27,869 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 17:03:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 17:03:27,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:27,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:27,872 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-07 17:03:27,873 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-07 17:03:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:27,879 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 17:03:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 17:03:27,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:27,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:27,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:27,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:27,882 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-07 17:03:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-07 17:03:27,889 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-07 17:03:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:27,889 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-07 17:03:27,890 INFO L479 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-07 17:03:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-07 17:03:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 17:03:27,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:27,891 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:27,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:03:27,891 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1058544685, now seen corresponding path program 1 times [2022-04-07 17:03:27,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:27,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389267980] [2022-04-07 17:03:27,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:27,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:28,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:28,035 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-07 17:03:28,036 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-07 17:03:28,036 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-07 17:03:28,037 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-07 17:03:28,037 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-07 17:03:28,037 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-07 17:03:28,038 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-07 17:03:28,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-07 17:03:28,038 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-07 17:03:28,038 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-07 17:03:28,038 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-07 17:03:28,039 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-07 17:03:28,039 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-07 17:03:28,040 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-07 17:03:28,040 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-07 17:03:28,041 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-07 17:03:28,042 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-07 17:03:28,042 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-07 17:03:28,043 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-07 17:03:28,044 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-07 17:03:28,045 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-07 17:03:28,045 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-07 17:03:28,046 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-07 17:03:28,046 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-07 17:03:28,047 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-07 17:03:28,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:28,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389267980] [2022-04-07 17:03:28,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389267980] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:28,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203393752] [2022-04-07 17:03:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:28,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:28,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:28,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:28,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 17:03:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:28,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 17:03:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:28,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:28,725 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-07 17:03:28,725 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-07 17:03:28,726 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-07 17:03:28,729 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-07 17:03:28,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-07 17:03:28,730 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-07 17:03:28,730 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-07 17:03:28,732 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-07 17:03:28,732 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-07 17:03:28,733 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-07 17:03:28,734 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-07 17:03:28,734 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-07 17:03:28,735 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-07 17:03:28,736 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-07 17:03:28,736 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-07 17:03:28,737 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-07 17:03:28,738 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-07 17:03:28,739 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-07 17:03:28,740 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-07 17:03:28,744 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-07 17:03:28,744 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-07 17:03:28,745 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-07 17:03:28,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:03:28,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203393752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:28,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:03:28,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-07 17:03:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844020078] [2022-04-07 17:03:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:28,753 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-07 17:03:28,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:28,754 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-07 17:03:28,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:28,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 17:03:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:28,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 17:03:28,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-07 17:03:28,774 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-07 17:03:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:29,078 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 17:03:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:03:29,078 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-07 17:03:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:29,079 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-07 17:03:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-07 17:03:29,082 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-07 17:03:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-07 17:03:29,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-07 17:03:29,126 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-07 17:03:29,128 INFO L225 Difference]: With dead ends: 47 [2022-04-07 17:03:29,128 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 17:03:29,129 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-07 17:03:29,130 INFO L913 BasicCegarLoop]: 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-07 17:03:29,130 INFO L914 BasicCegarLoop]: 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-07 17:03:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 17:03:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-04-07 17:03:29,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:29,134 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-07 17:03:29,135 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-07 17:03:29,135 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-07 17:03:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:29,138 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 17:03:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 17:03:29,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:29,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:29,139 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-07 17:03:29,140 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-07 17:03:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:29,143 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 17:03:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 17:03:29,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:29,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:29,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:29,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:29,144 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-07 17:03:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-07 17:03:29,146 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-04-07 17:03:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:29,146 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-07 17:03:29,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 17:03:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 17:03:29,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:29,147 INFO L499 BasicCegarLoop]: 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-07 17:03:29,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:29,371 WARN L460 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-07 17:03:29,372 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1484070290, now seen corresponding path program 1 times [2022-04-07 17:03:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:29,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291768715] [2022-04-07 17:03:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,537 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-07 17:03:29,538 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-07 17:03:29,538 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-07 17:03:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 17:03:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,548 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-07 17:03:29,549 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-07 17:03:29,549 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-07 17:03:29,550 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-07 17:03:29,551 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-07 17:03:29,551 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-07 17:03:29,551 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-07 17:03:29,551 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-07 17:03:29,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-07 17:03:29,552 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-07 17:03:29,552 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-07 17:03:29,552 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-07 17:03:29,553 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-07 17:03:29,553 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-07 17:03:29,568 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-07 17:03:29,569 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-07 17:03:29,569 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-07 17:03:29,570 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-07 17:03:29,570 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-07 17:03:29,570 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-07 17:03:29,571 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-07 17:03:29,571 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-07 17:03:29,572 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-07 17:03:29,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-07 17:03:29,573 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-07 17:03:29,574 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-07 17:03:29,575 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-07 17:03:29,575 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-07 17:03:29,576 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-07 17:03:29,576 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-07 17:03:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:29,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291768715] [2022-04-07 17:03:29,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291768715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:29,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057820168] [2022-04-07 17:03:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:29,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:29,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 17:03:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 17:03:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:29,805 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-07 17:03:29,806 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-07 17:03:29,806 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-07 17:03:29,806 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-07 17:03:29,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-07 17:03:29,806 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-07 17:03:29,807 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-07 17:03:29,807 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-07 17:03:29,807 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-07 17:03:29,807 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-07 17:03:29,808 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-07 17:03:29,809 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-07 17:03:29,810 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-07 17:03:29,810 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-07 17:03:29,810 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-07 17:03:29,810 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-07 17:03:29,811 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-07 17:03:29,811 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-07 17:03:29,811 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-07 17:03:29,811 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-07 17:03:29,811 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-07 17:03:29,812 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-07 17:03:29,812 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-07 17:03:29,812 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-07 17:03:29,812 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-07 17:03:29,812 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-07 17:03:29,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:03:29,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057820168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:29,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:03:29,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-04-07 17:03:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072647877] [2022-04-07 17:03:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:29,814 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-07 17:03:29,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:29,814 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-07 17:03:29,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:29,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:03:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:03:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:03:29,834 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-07 17:03:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:29,881 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 17:03:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:03:29,881 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-07 17:03:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:29,882 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-07 17:03:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 17:03:29,889 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-07 17:03:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 17:03:29,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-07 17:03:29,923 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-07 17:03:29,925 INFO L225 Difference]: With dead ends: 33 [2022-04-07 17:03:29,925 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 17:03:29,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:03:29,926 INFO L913 BasicCegarLoop]: 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-07 17:03:29,926 INFO L914 BasicCegarLoop]: 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-07 17:03:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 17:03:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-07 17:03:29,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:29,930 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-07 17:03:29,930 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-07 17:03:29,930 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-07 17:03:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:29,932 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 17:03:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 17:03:29,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:29,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:29,933 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-07 17:03:29,933 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-07 17:03:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:29,934 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 17:03:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 17:03:29,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:29,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:29,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:29,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:29,935 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-07 17:03:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-07 17:03:29,936 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-07 17:03:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:29,937 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-07 17:03:29,937 INFO L479 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-07 17:03:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-07 17:03:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 17:03:29,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:29,938 INFO L499 BasicCegarLoop]: 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-07 17:03:29,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 17:03:30,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 17:03:30,145 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 551024538, now seen corresponding path program 1 times [2022-04-07 17:03:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012213436] [2022-04-07 17:03:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:30,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:30,229 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-07 17:03:30,229 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-07 17:03:30,229 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-07 17:03:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 17:03:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:30,236 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-07 17:03:30,237 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-07 17:03:30,237 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-07 17:03:30,238 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-07 17:03:30,238 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-07 17:03:30,239 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-07 17:03:30,239 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-07 17:03:30,239 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-07 17:03:30,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-07 17:03:30,239 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-07 17:03:30,240 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-07 17:03:30,240 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-07 17:03:30,240 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-07 17:03:30,240 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-07 17:03:30,241 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-07 17:03:30,241 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-07 17:03:30,241 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-07 17:03:30,242 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-07 17:03:30,242 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-07 17:03:30,243 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-07 17:03:30,243 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-07 17:03:30,243 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-07 17:03:30,244 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-07 17:03:30,244 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-07 17:03:30,244 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-07 17:03:30,245 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-07 17:03:30,245 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-07 17:03:30,246 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-07 17:03:30,246 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-07 17:03:30,246 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-07 17:03:30,246 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-07 17:03:30,246 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-07 17:03:30,247 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-07 17:03:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:30,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012213436] [2022-04-07 17:03:30,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012213436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:30,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199318066] [2022-04-07 17:03:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:30,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:30,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:30,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:03:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:30,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:03:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:30,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:31,026 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-07 17:03:31,026 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-07 17:03:31,027 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-07 17:03:31,027 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-07 17:03:31,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-07 17:03:31,027 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-07 17:03:31,027 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-07 17:03:31,031 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-07 17:03:31,032 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-07 17:03:31,033 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-07 17:03:31,033 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-07 17:03:31,035 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-07 17:03:31,035 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-07 17:03:31,036 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-07 17:03:31,036 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-07 17:03:31,038 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-07 17:03:31,038 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-07 17:03:31,039 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-07 17:03:31,039 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-07 17:03:31,039 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-07 17:03:31,041 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-07 17:03:31,042 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-07 17:03:31,044 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-07 17:03:31,047 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-07 17:03:31,048 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-07 17:03:31,049 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-07 17:03:31,049 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-07 17:03:31,049 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-07 17:03:31,049 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-07 17:03:31,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:31,186 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-07 17:03:31,186 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-07 17:03:31,186 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-07 17:03:31,186 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-07 17:03:31,187 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-07 17:03:31,189 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-07 17:03:31,189 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-07 17:03:31,190 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-07 17:03:31,190 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-07 17:03:31,190 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-07 17:03:31,190 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-07 17:03:31,190 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-07 17:03:31,191 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-07 17:03:31,191 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-07 17:03:31,196 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-07 17:03:31,197 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-07 17:03:31,197 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-07 17:03:31,199 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-07 17:03:31,199 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-07 17:03:31,199 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-07 17:03:31,199 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-07 17:03:31,199 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-07 17:03:31,200 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-07 17:03:31,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#true} is VALID [2022-04-07 17:03:31,200 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-07 17:03:31,200 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-07 17:03:31,200 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-07 17:03:31,200 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-07 17:03:31,201 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-07 17:03:31,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199318066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:31,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:31,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 17:03:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331735244] [2022-04-07 17:03:31,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:31,202 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-07 17:03:31,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:31,203 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-07 17:03:31,232 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-07 17:03:31,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 17:03:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 17:03:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 17:03:31,233 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-07 17:03:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:31,864 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 17:03:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 17:03:31,864 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-07 17:03:31,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:31,865 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-07 17:03:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-07 17:03:31,867 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-07 17:03:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-07 17:03:31,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-07 17:03:31,919 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-07 17:03:31,920 INFO L225 Difference]: With dead ends: 47 [2022-04-07 17:03:31,920 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 17:03:31,921 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-04-07 17:03:31,921 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:31,922 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 45 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:03:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 17:03:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-07 17:03:31,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:31,926 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-07 17:03:31,926 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-07 17:03:31,926 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-07 17:03:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:31,929 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 17:03:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 17:03:31,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:31,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:31,934 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-07 17:03:31,934 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-07 17:03:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:31,940 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 17:03:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 17:03:31,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:31,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:31,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:31,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:31,941 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-07 17:03:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-04-07 17:03:31,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2022-04-07 17:03:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:31,942 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-04-07 17:03:31,943 INFO L479 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-07 17:03:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 17:03:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 17:03:31,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:31,944 INFO L499 BasicCegarLoop]: 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-07 17:03:31,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:32,144 WARN L460 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-07 17:03:32,145 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1358482081, now seen corresponding path program 1 times [2022-04-07 17:03:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026365877] [2022-04-07 17:03:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,208 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-07 17:03:32,209 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-07 17:03:32,209 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-07 17:03:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-07 17:03:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,213 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-07 17:03:32,214 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-07 17:03:32,214 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-07 17:03:32,214 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-07 17:03:32,214 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-07 17:03:32,215 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-07 17:03:32,215 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-07 17:03:32,215 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-07 17:03:32,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {1089#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#true} is VALID [2022-04-07 17:03:32,215 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-07 17:03:32,215 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-07 17:03:32,216 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-07 17:03:32,216 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-07 17:03:32,216 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-07 17:03:32,216 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-07 17:03:32,216 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-07 17:03:32,216 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-07 17:03:32,216 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-07 17:03:32,217 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-07 17:03:32,217 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-07 17:03:32,218 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-07 17:03:32,218 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-07 17:03:32,218 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-07 17:03:32,218 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-07 17:03:32,218 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-07 17:03:32,219 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-07 17:03:32,219 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-07 17:03:32,219 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-07 17:03:32,219 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-07 17:03:32,219 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-07 17:03:32,219 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-07 17:03:32,219 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-07 17:03:32,220 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-07 17:03:32,220 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-07 17:03:32,220 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-07 17:03:32,220 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-07 17:03:32,220 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-07 17:03:32,220 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-07 17:03:32,220 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-07 17:03:32,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:32,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026365877] [2022-04-07 17:03:32,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026365877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:32,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:32,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:03:32,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655712382] [2022-04-07 17:03:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:32,222 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-07 17:03:32,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:32,222 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-07 17:03:32,242 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-07 17:03:32,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:03:32,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:32,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:03:32,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:03:32,243 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-07 17:03:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:32,367 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 17:03:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:03:32,367 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-07 17:03:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:32,368 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-07 17:03:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-07 17:03:32,369 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-07 17:03:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-07 17:03:32,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-07 17:03:32,393 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-07 17:03:32,394 INFO L225 Difference]: With dead ends: 41 [2022-04-07 17:03:32,394 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 17:03:32,395 INFO L912 BasicCegarLoop]: 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-07 17:03:32,395 INFO L913 BasicCegarLoop]: 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-07 17:03:32,396 INFO L914 BasicCegarLoop]: 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-07 17:03:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 17:03:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-07 17:03:32,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:32,399 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-07 17:03:32,399 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-07 17:03:32,400 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-07 17:03:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:32,401 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 17:03:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 17:03:32,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:32,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:32,402 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-07 17:03:32,402 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-07 17:03:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:32,404 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 17:03:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 17:03:32,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:32,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:32,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:32,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:32,405 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-07 17:03:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-07 17:03:32,406 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 34 [2022-04-07 17:03:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:32,406 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-07 17:03:32,406 INFO L479 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-07 17:03:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 17:03:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 17:03:32,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:32,407 INFO L499 BasicCegarLoop]: 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-07 17:03:32,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 17:03:32,407 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1686349908, now seen corresponding path program 2 times [2022-04-07 17:03:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:32,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143981699] [2022-04-07 17:03:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,529 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-07 17:03:32,529 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-07 17:03:32,530 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-07 17:03:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 17:03:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,544 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-07 17:03:32,545 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-07 17:03:32,545 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-07 17:03:32,546 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-07 17:03:32,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-07 17:03:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,556 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-07 17:03:32,556 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-07 17:03:32,556 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-07 17:03:32,558 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-07 17:03:32,559 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-07 17:03:32,559 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-07 17:03:32,559 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-07 17:03:32,559 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-07 17:03:32,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {1272#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-07 17:03:32,560 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-07 17:03:32,560 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-07 17:03:32,560 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-07 17:03:32,560 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-07 17:03:32,560 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-07 17:03:32,562 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-07 17:03:32,563 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-07 17:03:32,563 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-07 17:03:32,563 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-07 17:03:32,564 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-07 17:03:32,564 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-07 17:03:32,565 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-07 17:03:32,565 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-07 17:03:32,565 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-07 17:03:32,565 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-07 17:03:32,565 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-07 17:03:32,566 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-07 17:03:32,566 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-07 17:03:32,567 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-07 17:03:32,567 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-07 17:03:32,567 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-07 17:03:32,568 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-07 17:03:32,568 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-07 17:03:32,569 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-07 17:03:32,569 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-07 17:03:32,569 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-07 17:03:32,570 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-07 17:03:32,570 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-07 17:03:32,570 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-07 17:03:32,571 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-07 17:03:32,572 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-07 17:03:32,572 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-07 17:03:32,574 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-07 17:03:32,575 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-07 17:03:32,575 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-07 17:03:32,576 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-07 17:03:32,577 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-07 17:03:32,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:32,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143981699] [2022-04-07 17:03:32,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143981699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:32,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542176224] [2022-04-07 17:03:32,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 17:03:32,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:32,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:32,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:32,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 17:03:32,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 17:03:32,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:03:32,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:03:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:32,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:33,072 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-07 17:03:33,073 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-07 17:03:33,073 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-07 17:03:33,073 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-07 17:03:33,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1272#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-07 17:03:33,073 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-07 17:03:33,073 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-07 17:03:33,073 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-07 17:03:33,073 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-07 17:03:33,073 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,074 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-07 17:03:33,075 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-07 17:03:33,075 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-07 17:03:33,075 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-07 17:03:33,075 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-07 17:03:33,075 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-07 17:03:33,075 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-07 17:03:33,076 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-07 17:03:33,076 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-07 17:03:33,077 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-07 17:03:33,077 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-07 17:03:33,077 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-07 17:03:33,077 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-07 17:03:33,077 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-07 17:03:33,078 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-07 17:03:33,079 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-07 17:03:33,079 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-07 17:03:33,080 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-07 17:03:33,080 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-07 17:03:33,081 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-07 17:03:33,081 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-07 17:03:33,081 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-07 17:03:33,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:33,330 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-07 17:03:33,330 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-07 17:03:33,331 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-07 17:03:33,332 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-07 17:03:33,332 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-07 17:03:33,333 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-07 17:03:33,334 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-07 17:03:33,334 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-07 17:03:33,334 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-07 17:03:33,334 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-07 17:03:33,334 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-07 17:03:33,335 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-07 17:03:33,335 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-07 17:03:33,336 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-07 17:03:33,336 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-07 17:03:33,336 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-07 17:03:33,336 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-07 17:03:33,336 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-07 17:03:33,336 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-07 17:03:33,342 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-07 17:03:33,342 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-07 17:03:33,343 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-07 17:03:33,344 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-07 17:03:33,347 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-07 17:03:33,348 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-07 17:03:33,348 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-07 17:03:33,348 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-07 17:03:33,348 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-07 17:03:33,348 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-07 17:03:33,348 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-07 17:03:33,348 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-07 17:03:33,349 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-07 17:03:33,349 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-07 17:03:33,349 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-07 17:03:33,349 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-07 17:03:33,349 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-07 17:03:33,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {1272#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1272#true} is VALID [2022-04-07 17:03:33,349 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-07 17:03:33,350 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-07 17:03:33,350 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-07 17:03:33,350 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-07 17:03:33,350 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-07 17:03:33,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542176224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:33,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:33,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-04-07 17:03:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767947768] [2022-04-07 17:03:33,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:33,351 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-07 17:03:33,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:33,352 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-07 17:03:33,400 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-07 17:03:33,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 17:03:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 17:03:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-07 17:03:33,401 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-07 17:03:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:34,064 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-07 17:03:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 17:03:34,065 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-07 17:03:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:34,065 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-07 17:03:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2022-04-07 17:03:34,066 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-07 17:03:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2022-04-07 17:03:34,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2022-04-07 17:03:34,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:34,112 INFO L225 Difference]: With dead ends: 40 [2022-04-07 17:03:34,112 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:03:34,112 INFO L912 BasicCegarLoop]: 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-07 17:03:34,113 INFO L913 BasicCegarLoop]: 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-07 17:03:34,113 INFO L914 BasicCegarLoop]: 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-07 17:03:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:03:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:03:34,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:34,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:34,114 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:34,114 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:34,114 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:34,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:34,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:34,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:34,115 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:34,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:34,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:34,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:34,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:34,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:03:34,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-04-07 17:03:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:34,116 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:03:34,116 INFO L479 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-07 17:03:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:34,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:34,118 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:03:34,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:34,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:34,322 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-07 17:03:34,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:03:34,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:34 BasicIcfg [2022-04-07 17:03:34,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:03:34,326 INFO L158 Benchmark]: Toolchain (without parser) took 8704.35ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 132.4MB in the beginning and 99.4MB in the end (delta: 33.0MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2022-04-07 17:03:34,327 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory was 148.6MB in the beginning and 148.5MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:03:34,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.18ms. Allocated memory is still 183.5MB. Free memory was 132.2MB in the beginning and 158.8MB in the end (delta: -26.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-07 17:03:34,327 INFO L158 Benchmark]: Boogie Preprocessor took 52.00ms. Allocated memory is still 183.5MB. Free memory was 158.8MB in the beginning and 157.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:03:34,327 INFO L158 Benchmark]: RCFGBuilder took 435.09ms. Allocated memory is still 183.5MB. Free memory was 157.0MB in the beginning and 143.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 17:03:34,328 INFO L158 Benchmark]: IcfgTransformer took 80.32ms. Allocated memory is still 183.5MB. Free memory was 143.9MB in the beginning and 141.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:03:34,328 INFO L158 Benchmark]: TraceAbstraction took 7820.25ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 141.3MB in the beginning and 99.4MB in the end (delta: 41.9MB). Peak memory consumption was 79.9MB. Max. memory is 8.0GB. [2022-04-07 17:03:34,329 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.15ms. Allocated memory is still 183.5MB. Free memory was 148.6MB in the beginning and 148.5MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.18ms. Allocated memory is still 183.5MB. Free memory was 132.2MB in the beginning and 158.8MB in the end (delta: -26.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.00ms. Allocated memory is still 183.5MB. Free memory was 158.8MB in the beginning and 157.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 435.09ms. Allocated memory is still 183.5MB. Free memory was 157.0MB in the beginning and 143.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 80.32ms. Allocated memory is still 183.5MB. Free memory was 143.9MB in the beginning and 141.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7820.25ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 141.3MB in the beginning and 99.4MB in the end (delta: 41.9MB). Peak memory consumption was 79.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 0.8s 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, 1.0s 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.2s SatisfiabilityAnalysisTime, 3.2s 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-07 17:03:34,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...