/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 11:02:34,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 11:02:34,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 11:02:34,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 11:02:34,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 11:02:34,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 11:02:34,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 11:02:34,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 11:02:34,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 11:02:34,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 11:02:34,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 11:02:34,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 11:02:34,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 11:02:34,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 11:02:34,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 11:02:34,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 11:02:34,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 11:02:34,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 11:02:34,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 11:02:34,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 11:02:34,896 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 11:02:34,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 11:02:34,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 11:02:34,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 11:02:34,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 11:02:34,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 11:02:34,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 11:02:34,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 11:02:34,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 11:02:34,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 11:02:34,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 11:02:34,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 11:02:34,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 11:02:34,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 11:02:34,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 11:02:34,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 11:02:34,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 11:02:34,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 11:02:34,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 11:02:34,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 11:02:34,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 11:02:34,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 11:02:34,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 11:02:34,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 11:02:34,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 11:02:34,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 11:02:34,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 11:02:34,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 11:02:34,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 11:02:34,934 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 11:02:34,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 11:02:34,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 11:02:34,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 11:02:34,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 11:02:34,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 11:02:34,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 11:02:34,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 11:02:34,937 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-06 11:02:35,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 11:02:35,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 11:02:35,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 11:02:35,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 11:02:35,117 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 11:02:35,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-04-06 11:02:35,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ad7dce/05caab8040cd426595fe0bf6afdad631/FLAG0fe06ad21 [2022-04-06 11:02:35,479 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 11:02:35,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-04-06 11:02:35,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ad7dce/05caab8040cd426595fe0bf6afdad631/FLAG0fe06ad21 [2022-04-06 11:02:35,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ad7dce/05caab8040cd426595fe0bf6afdad631 [2022-04-06 11:02:35,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 11:02:35,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 11:02:35,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 11:02:35,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 11:02:35,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 11:02:35,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bd8d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35, skipping insertion in model container [2022-04-06 11:02:35,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 11:02:35,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 11:02:35,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-04-06 11:02:35,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 11:02:35,656 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 11:02:35,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-04-06 11:02:35,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 11:02:35,680 INFO L208 MainTranslator]: Completed translation [2022-04-06 11:02:35,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35 WrapperNode [2022-04-06 11:02:35,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 11:02:35,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 11:02:35,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 11:02:35,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 11:02:35,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 11:02:35,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 11:02:35,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 11:02:35,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 11:02:35,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:35,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 11:02:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:35,764 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-06 11:02:35,765 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-06 11:02:35,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 11:02:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 11:02:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 11:02:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 11:02:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 11:02:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 11:02:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 11:02:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 11:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 11:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 11:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-06 11:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 11:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 11:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 11:02:35,837 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 11:02:35,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 11:02:35,971 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 11:02:35,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 11:02:35,981 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 11:02:35,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:02:35 BoogieIcfgContainer [2022-04-06 11:02:35,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 11:02:35,995 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 11:02:35,995 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 11:02:35,996 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 11:02:35,998 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:02:35" (1/1) ... [2022-04-06 11:02:36,012 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 11:02:36,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 11:02:36 BasicIcfg [2022-04-06 11:02:36,036 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 11:02:36,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 11:02:36,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 11:02:36,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 11:02:36,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 11:02:35" (1/4) ... [2022-04-06 11:02:36,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf5669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:02:36, skipping insertion in model container [2022-04-06 11:02:36,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:02:35" (2/4) ... [2022-04-06 11:02:36,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf5669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:02:36, skipping insertion in model container [2022-04-06 11:02:36,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:02:35" (3/4) ... [2022-04-06 11:02:36,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf5669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 11:02:36, skipping insertion in model container [2022-04-06 11:02:36,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 11:02:36" (4/4) ... [2022-04-06 11:02:36,040 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.cqvasr [2022-04-06 11:02:36,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 11:02:36,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 11:02:36,071 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 11:02:36,075 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-06 11:02:36,075 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 11:02:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-06 11:02:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-06 11:02:36,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:36,087 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:36,088 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-06 11:02:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751074826] [2022-04-06 11:02:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 11:02:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,197 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-06 11:02:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:36,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751074826] [2022-04-06 11:02:36,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751074826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:02:36,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:02:36,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 11:02:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501036545] [2022-04-06 11:02:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:02:36,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 11:02:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 11:02:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 11:02:36,221 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 11:02:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:36,306 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-06 11:02:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 11:02:36,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-06 11:02:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:36,316 INFO L225 Difference]: With dead ends: 57 [2022-04-06 11:02:36,316 INFO L226 Difference]: Without dead ends: 27 [2022-04-06 11:02:36,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 11:02:36,320 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:36,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-06 11:02:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-06 11:02:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-06 11:02:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-06 11:02:36,353 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-06 11:02:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:36,353 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-06 11:02:36,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 11:02:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-06 11:02:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 11:02:36,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:36,354 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:36,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 11:02:36,354 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-06 11:02:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:36,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152727827] [2022-04-06 11:02:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 11:02:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,416 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-06 11:02:36,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:36,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152727827] [2022-04-06 11:02:36,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152727827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:02:36,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:02:36,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 11:02:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765920075] [2022-04-06 11:02:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:02:36,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:02:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:02:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:02:36,419 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 11:02:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:36,488 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-06 11:02:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 11:02:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-06 11:02:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:36,490 INFO L225 Difference]: With dead ends: 40 [2022-04-06 11:02:36,490 INFO L226 Difference]: Without dead ends: 28 [2022-04-06 11:02:36,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:02:36,491 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:36,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-06 11:02:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-06 11:02:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-06 11:02:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-06 11:02:36,508 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-06 11:02:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:36,508 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-06 11:02:36,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 11:02:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-06 11:02:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 11:02:36,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:36,509 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:36,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 11:02:36,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:36,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-06 11:02:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:36,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012737098] [2022-04-06 11:02:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 11:02:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,620 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-06 11:02:36,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:36,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012737098] [2022-04-06 11:02:36,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012737098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:02:36,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:02:36,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 11:02:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951382896] [2022-04-06 11:02:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:02:36,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 11:02:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 11:02:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:02:36,623 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-06 11:02:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:36,765 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-06 11:02:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 11:02:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-06 11:02:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:36,768 INFO L225 Difference]: With dead ends: 34 [2022-04-06 11:02:36,768 INFO L226 Difference]: Without dead ends: 32 [2022-04-06 11:02:36,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:02:36,774 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:36,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-06 11:02:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-06 11:02:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-06 11:02:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-06 11:02:36,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-06 11:02:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:36,790 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-06 11:02:36,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-06 11:02:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-06 11:02:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 11:02:36,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:36,790 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:36,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 11:02:36,791 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-06 11:02:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:36,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570428856] [2022-04-06 11:02:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:36,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:36,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12227732] [2022-04-06 11:02:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:36,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:36,821 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-06 11:02:36,823 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-06 11:02:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:36,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:02:36,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:37,000 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-06 11:02:37,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:02:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570428856] [2022-04-06 11:02:37,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12227732] [2022-04-06 11:02:37,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12227732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:02:37,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:02:37,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:02:37,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595047853] [2022-04-06 11:02:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:02:37,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:02:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:02:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:02:37,002 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-06 11:02:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:37,071 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-06 11:02:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:02:37,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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 17 [2022-04-06 11:02:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:37,072 INFO L225 Difference]: With dead ends: 50 [2022-04-06 11:02:37,073 INFO L226 Difference]: Without dead ends: 48 [2022-04-06 11:02:37,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:02:37,073 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:37,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 137 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-06 11:02:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-06 11:02:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-06 11:02:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-06 11:02:37,080 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-06 11:02:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:37,080 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-06 11:02:37,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 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-06 11:02:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-06 11:02:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 11:02:37,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:37,081 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:37,099 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-06 11:02:37,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:37,300 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-06 11:02:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:37,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205903069] [2022-04-06 11:02:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:37,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:37,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197760638] [2022-04-06 11:02:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:37,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:37,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:37,318 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-06 11:02:37,321 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-06 11:02:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:37,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:02:37,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:02:37,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:02:37,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:37,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205903069] [2022-04-06 11:02:37,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:37,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197760638] [2022-04-06 11:02:37,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197760638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:02:37,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:02:37,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:02:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795777887] [2022-04-06 11:02:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:02:37,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:02:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:37,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:02:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:02:37,428 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:02:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:37,484 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-06 11:02:37,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:02:37,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-06 11:02:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:37,486 INFO L225 Difference]: With dead ends: 54 [2022-04-06 11:02:37,486 INFO L226 Difference]: Without dead ends: 52 [2022-04-06 11:02:37,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:02:37,488 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:37,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:02:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-06 11:02:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-06 11:02:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-06 11:02:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-06 11:02:37,509 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-06 11:02:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:37,509 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-06 11:02:37,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:02:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-06 11:02:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-06 11:02:37,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:37,511 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:37,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:37,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:37,725 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-06 11:02:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:37,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553945988] [2022-04-06 11:02:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:37,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:37,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388383930] [2022-04-06 11:02:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:37,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:37,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:37,734 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-06 11:02:37,735 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-06 11:02:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:37,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 11:02:37,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 11:02:37,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:02:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:37,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553945988] [2022-04-06 11:02:37,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:37,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388383930] [2022-04-06 11:02:37,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388383930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:02:37,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:02:37,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:02:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709091485] [2022-04-06 11:02:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:02:37,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:02:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:02:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:02:37,871 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-06 11:02:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:37,942 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-06 11:02:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:02:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-06 11:02:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:37,944 INFO L225 Difference]: With dead ends: 62 [2022-04-06 11:02:37,944 INFO L226 Difference]: Without dead ends: 50 [2022-04-06 11:02:37,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:02:37,946 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:37,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-06 11:02:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-06 11:02:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-06 11:02:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-06 11:02:37,963 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-06 11:02:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:37,964 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-06 11:02:37,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-06 11:02:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-06 11:02:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-06 11:02:37,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:37,965 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:37,984 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-06 11:02:38,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:38,176 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-06 11:02:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:38,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737937532] [2022-04-06 11:02:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:38,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:38,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305865083] [2022-04-06 11:02:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:38,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:38,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:38,192 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-06 11:02:38,193 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-06 11:02:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:38,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:02:38,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-06 11:02:38,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-06 11:02:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737937532] [2022-04-06 11:02:38,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305865083] [2022-04-06 11:02:38,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305865083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:38,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-06 11:02:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510074562] [2022-04-06 11:02:38,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:38,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 11:02:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 11:02:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-06 11:02:38,413 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-06 11:02:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:38,507 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-06 11:02:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 11:02:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-06 11:02:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:38,509 INFO L225 Difference]: With dead ends: 120 [2022-04-06 11:02:38,509 INFO L226 Difference]: Without dead ends: 104 [2022-04-06 11:02:38,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 11:02:38,512 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 58 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:38,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-06 11:02:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-06 11:02:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-06 11:02:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-06 11:02:38,537 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-06 11:02:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:38,538 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-06 11:02:38,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-06 11:02:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-06 11:02:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-06 11:02:38,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:38,540 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:38,566 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-06 11:02:38,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:38,755 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-04-06 11:02:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:38,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069875777] [2022-04-06 11:02:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:38,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:38,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85751415] [2022-04-06 11:02:38,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:38,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:38,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 11:02:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:38,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 11:02:38,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-06 11:02:38,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-06 11:02:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069875777] [2022-04-06 11:02:39,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85751415] [2022-04-06 11:02:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85751415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:39,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-06 11:02:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460002097] [2022-04-06 11:02:39,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:39,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 11:02:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 11:02:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-06 11:02:39,073 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-06 11:02:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:39,259 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-06 11:02:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 11:02:39,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-06 11:02:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:39,262 INFO L225 Difference]: With dead ends: 118 [2022-04-06 11:02:39,262 INFO L226 Difference]: Without dead ends: 116 [2022-04-06 11:02:39,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-06 11:02:39,263 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:39,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-06 11:02:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-06 11:02:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-06 11:02:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-06 11:02:39,277 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-06 11:02:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:39,277 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-06 11:02:39,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-06 11:02:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-06 11:02:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-06 11:02:39,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:39,282 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:39,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-06 11:02:39,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:39,495 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-04-06 11:02:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198643585] [2022-04-06 11:02:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:39,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:39,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145579635] [2022-04-06 11:02:39,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:02:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:39,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:39,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 11:02:39,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:02:39,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:39,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 11:02:39,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 11:02:39,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 11:02:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198643585] [2022-04-06 11:02:39,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145579635] [2022-04-06 11:02:39,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145579635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:39,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:39,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-06 11:02:39,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542196769] [2022-04-06 11:02:39,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:39,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 11:02:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 11:02:39,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-06 11:02:39,792 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-06 11:02:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:39,907 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-06 11:02:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 11:02:39,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-06 11:02:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:39,913 INFO L225 Difference]: With dead ends: 122 [2022-04-06 11:02:39,913 INFO L226 Difference]: Without dead ends: 120 [2022-04-06 11:02:39,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-06 11:02:39,915 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:39,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 208 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-06 11:02:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-06 11:02:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-06 11:02:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-06 11:02:39,936 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-06 11:02:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:39,937 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-06 11:02:39,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-06 11:02:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-06 11:02:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-06 11:02:39,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:39,939 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:39,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:40,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:40,164 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-04-06 11:02:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:40,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27016615] [2022-04-06 11:02:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:40,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214971472] [2022-04-06 11:02:40,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:02:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:40,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:40,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-06 11:02:40,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-06 11:02:40,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:40,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-06 11:02:40,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-06 11:02:40,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-06 11:02:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27016615] [2022-04-06 11:02:40,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214971472] [2022-04-06 11:02:40,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214971472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:40,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:40,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-06 11:02:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667330541] [2022-04-06 11:02:40,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:40,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 11:02:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 11:02:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 11:02:40,540 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-06 11:02:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:40,746 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-06 11:02:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 11:02:40,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-06 11:02:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:40,748 INFO L225 Difference]: With dead ends: 146 [2022-04-06 11:02:40,748 INFO L226 Difference]: Without dead ends: 135 [2022-04-06 11:02:40,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:02:40,748 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:40,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 11:02:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-06 11:02:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-06 11:02:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-06 11:02:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-06 11:02:40,758 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-06 11:02:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:40,759 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-06 11:02:40,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-06 11:02:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-06 11:02:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-06 11:02:40,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:40,759 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:40,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:40,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:40,982 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-04-06 11:02:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:40,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91874411] [2022-04-06 11:02:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:40,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060836874] [2022-04-06 11:02:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:40,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-06 11:02:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:41,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-06 11:02:41,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 11:02:41,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 11:02:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91874411] [2022-04-06 11:02:41,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:41,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060836874] [2022-04-06 11:02:41,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060836874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:41,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:41,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-06 11:02:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669457766] [2022-04-06 11:02:41,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:41,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 11:02:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 11:02:41,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:02:41,846 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-06 11:02:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:42,119 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-06 11:02:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 11:02:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-06 11:02:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:42,120 INFO L225 Difference]: With dead ends: 148 [2022-04-06 11:02:42,120 INFO L226 Difference]: Without dead ends: 144 [2022-04-06 11:02:42,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:02:42,121 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:42,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 11:02:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-06 11:02:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-06 11:02:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-06 11:02:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-06 11:02:42,135 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-06 11:02:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:42,136 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-06 11:02:42,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-06 11:02:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-06 11:02:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-06 11:02:42,136 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:42,136 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:42,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:42,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-06 11:02:42,350 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-04-06 11:02:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:42,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832838679] [2022-04-06 11:02:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:42,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:42,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086699397] [2022-04-06 11:02:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:42,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:42,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:42,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:42,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-06 11:02:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:02:42,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-06 11:02:42,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-06 11:02:42,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832838679] [2022-04-06 11:02:42,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086699397] [2022-04-06 11:02:42,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086699397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 11:02:42,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 11:02:42,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-06 11:02:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977439002] [2022-04-06 11:02:42,796 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:42,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 11:02:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 11:02:42,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:02:42,797 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-06 11:02:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:42,892 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-06 11:02:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 11:02:42,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-06 11:02:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:42,893 INFO L225 Difference]: With dead ends: 143 [2022-04-06 11:02:42,893 INFO L226 Difference]: Without dead ends: 132 [2022-04-06 11:02:42,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-06 11:02:42,893 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:42,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-06 11:02:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-06 11:02:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-06 11:02:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-06 11:02:42,904 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-06 11:02:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:42,904 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-06 11:02:42,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-06 11:02:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-06 11:02:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-06 11:02:42,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:42,905 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:42,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:43,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:43,119 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-04-06 11:02:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949246779] [2022-04-06 11:02:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:43,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:43,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858987316] [2022-04-06 11:02:43,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 11:02:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:43,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:43,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-06 11:02:45,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 11:02:45,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:45,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-06 11:02:45,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-06 11:02:45,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-06 11:02:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949246779] [2022-04-06 11:02:46,392 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858987316] [2022-04-06 11:02:46,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858987316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:46,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:46,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-06 11:02:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758814131] [2022-04-06 11:02:46,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:46,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 11:02:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 11:02:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:02:46,393 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-06 11:02:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:46,534 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-06 11:02:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 11:02:46,535 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-06 11:02:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:46,535 INFO L225 Difference]: With dead ends: 142 [2022-04-06 11:02:46,535 INFO L226 Difference]: Without dead ends: 138 [2022-04-06 11:02:46,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-06 11:02:46,536 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:46,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-06 11:02:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-06 11:02:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-06 11:02:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-06 11:02:46,549 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-06 11:02:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:46,549 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-06 11:02:46,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-06 11:02:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-06 11:02:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-06 11:02:46,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:46,550 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:46,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:46,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-06 11:02:46,759 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-04-06 11:02:46,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:46,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584100593] [2022-04-06 11:02:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:46,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850978973] [2022-04-06 11:02:46,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:02:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:46,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:46,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-06 11:02:46,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:02:46,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:46,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-06 11:02:46,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-06 11:02:47,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584100593] [2022-04-06 11:02:47,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850978973] [2022-04-06 11:02:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850978973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 11:02:47,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 11:02:47,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-06 11:02:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104067153] [2022-04-06 11:02:47,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:47,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 11:02:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 11:02:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-06 11:02:47,331 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-06 11:02:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:47,479 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-06 11:02:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 11:02:47,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-06 11:02:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:47,480 INFO L225 Difference]: With dead ends: 140 [2022-04-06 11:02:47,480 INFO L226 Difference]: Without dead ends: 129 [2022-04-06 11:02:47,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-06 11:02:47,481 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:47,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:02:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-06 11:02:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-06 11:02:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-06 11:02:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-06 11:02:47,492 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-06 11:02:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:47,492 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-06 11:02:47,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-06 11:02:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-06 11:02:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-06 11:02:47,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:47,493 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:47,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:47,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-06 11:02:47,707 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-04-06 11:02:47,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:47,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374635282] [2022-04-06 11:02:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:47,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:47,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217582178] [2022-04-06 11:02:47,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:02:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:47,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:47,715 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:47,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-06 11:02:47,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:02:47,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:47,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-06 11:02:47,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-06 11:02:48,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:48,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374635282] [2022-04-06 11:02:48,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:48,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217582178] [2022-04-06 11:02:48,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217582178] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 11:02:48,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 11:02:48,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-06 11:02:48,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430118838] [2022-04-06 11:02:48,408 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:48,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 11:02:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 11:02:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-06 11:02:48,408 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-06 11:02:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:48,629 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-06 11:02:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 11:02:48,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-06 11:02:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:48,630 INFO L225 Difference]: With dead ends: 152 [2022-04-06 11:02:48,630 INFO L226 Difference]: Without dead ends: 150 [2022-04-06 11:02:48,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:02:48,630 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:48,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 11:02:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-06 11:02:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-06 11:02:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-06 11:02:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-06 11:02:48,643 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-06 11:02:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:48,643 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-06 11:02:48,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-06 11:02:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-06 11:02:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-06 11:02:48,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:48,644 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:48,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:48,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-06 11:02:48,859 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-04-06 11:02:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:48,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464307757] [2022-04-06 11:02:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:48,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:48,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579528198] [2022-04-06 11:02:48,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:02:48,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:48,866 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:48,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-06 11:02:48,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:02:48,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:48,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 11:02:48,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-06 11:02:49,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-06 11:02:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:49,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464307757] [2022-04-06 11:02:49,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:49,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579528198] [2022-04-06 11:02:49,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579528198] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:49,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:49,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-06 11:02:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486767992] [2022-04-06 11:02:49,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:49,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 11:02:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 11:02:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:02:49,327 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-06 11:02:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:49,638 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-06 11:02:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-06 11:02:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-06 11:02:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:49,640 INFO L225 Difference]: With dead ends: 368 [2022-04-06 11:02:49,640 INFO L226 Difference]: Without dead ends: 353 [2022-04-06 11:02:49,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-06 11:02:49,641 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:49,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 355 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 11:02:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-06 11:02:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-06 11:02:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-06 11:02:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-06 11:02:49,668 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-06 11:02:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:49,669 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-06 11:02:49,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-06 11:02:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-06 11:02:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-06 11:02:49,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:49,670 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:49,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:49,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-06 11:02:49,883 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-04-06 11:02:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:49,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535208067] [2022-04-06 11:02:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:49,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:49,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878637881] [2022-04-06 11:02:49,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:02:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:49,890 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-06 11:02:50,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-06 11:02:50,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:50,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-06 11:02:50,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-06 11:02:50,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:50,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535208067] [2022-04-06 11:02:50,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:50,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878637881] [2022-04-06 11:02:50,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878637881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 11:02:50,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 11:02:50,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-06 11:02:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525341965] [2022-04-06 11:02:50,933 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:50,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 11:02:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 11:02:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-06 11:02:50,934 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-06 11:02:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:51,156 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-06 11:02:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 11:02:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-06 11:02:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:51,158 INFO L225 Difference]: With dead ends: 313 [2022-04-06 11:02:51,158 INFO L226 Difference]: Without dead ends: 302 [2022-04-06 11:02:51,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:02:51,159 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:51,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 11:02:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-06 11:02:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-06 11:02:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-06 11:02:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-06 11:02:51,183 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-06 11:02:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:51,183 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-06 11:02:51,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-06 11:02:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-06 11:02:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-06 11:02:51,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:51,184 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:51,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:51,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:51,390 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-04-06 11:02:51,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:51,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628617813] [2022-04-06 11:02:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:51,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:51,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736634546] [2022-04-06 11:02:51,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:02:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:51,398 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:51,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-06 11:02:51,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-06 11:02:51,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:02:51,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 11:02:51,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:02:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-06 11:02:52,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:02:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-06 11:02:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:02:52,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628617813] [2022-04-06 11:02:52,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:02:52,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736634546] [2022-04-06 11:02:52,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736634546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:02:52,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:02:52,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-06 11:02:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125159053] [2022-04-06 11:02:52,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:02:52,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-06 11:02:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:02:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-06 11:02:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-06 11:02:52,632 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-06 11:02:54,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:02:56,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:02:58,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:02:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:02:58,086 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-06 11:02:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 11:02:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-06 11:02:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:02:58,088 INFO L225 Difference]: With dead ends: 311 [2022-04-06 11:02:58,088 INFO L226 Difference]: Without dead ends: 309 [2022-04-06 11:02:58,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-06 11:02:58,088 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:02:58,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 125 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-06 11:02:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-06 11:02:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-06 11:02:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-06 11:02:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-06 11:02:58,115 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-06 11:02:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:02:58,115 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-06 11:02:58,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-06 11:02:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-06 11:02:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-06 11:02:58,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:02:58,116 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:02:58,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-06 11:02:58,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-06 11:02:58,321 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:02:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:02:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-04-06 11:02:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:02:58,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104849518] [2022-04-06 11:02:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:02:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:02:58,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:02:58,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042171747] [2022-04-06 11:02:58,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 11:02:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:02:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:02:58,333 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:02:58,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-06 11:03:00,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 11:03:00,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:03:00,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-06 11:03:00,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:04:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-04-06 11:04:50,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:04:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-04-06 11:04:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:04:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104849518] [2022-04-06 11:04:51,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:04:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042171747] [2022-04-06 11:04:51,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042171747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:04:51,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:04:51,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-06 11:04:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587691863] [2022-04-06 11:04:51,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:04:51,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-06 11:04:51,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:04:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-06 11:04:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=242, Unknown=1, NotChecked=0, Total=306 [2022-04-06 11:04:51,033 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-06 11:04:55,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:04:56,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:04:57,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:04:59,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:00,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:02,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:06,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:16,083 WARN L232 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 78 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 11:05:20,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:21,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:22,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:24,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:28,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:05:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:05:29,127 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-06 11:05:29,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 11:05:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-06 11:05:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:05:29,128 INFO L225 Difference]: With dead ends: 315 [2022-04-06 11:05:29,128 INFO L226 Difference]: Without dead ends: 294 [2022-04-06 11:05:29,129 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 300 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=124, Invalid=426, Unknown=2, NotChecked=0, Total=552 [2022-04-06 11:05:29,129 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 85 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:05:29,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 214 Invalid, 4 Unknown, 0 Unchecked, 25.4s Time] [2022-04-06 11:05:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-06 11:05:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-06 11:05:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-06 11:05:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-06 11:05:29,152 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-06 11:05:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:05:29,152 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-06 11:05:29,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-06 11:05:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-06 11:05:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-06 11:05:29,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:05:29,155 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:05:29,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-06 11:05:29,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:05:29,361 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:05:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:05:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-04-06 11:05:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:05:29,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772100380] [2022-04-06 11:05:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:05:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:05:29,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:05:29,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446204546] [2022-04-06 11:05:29,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:05:29,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:05:29,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:05:29,372 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:05:29,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-06 11:05:29,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-06 11:05:29,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:05:29,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 11:05:29,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:05:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-06 11:05:30,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:05:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-04-06 11:05:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:05:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772100380] [2022-04-06 11:05:30,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:05:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446204546] [2022-04-06 11:05:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446204546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:05:30,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:05:30,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-06 11:05:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007301530] [2022-04-06 11:05:30,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:05:30,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 11:05:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:05:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 11:05:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-06 11:05:30,786 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-06 11:05:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:05:31,516 INFO L93 Difference]: Finished difference Result 640 states and 652 transitions. [2022-04-06 11:05:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-06 11:05:31,516 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) Word has length 297 [2022-04-06 11:05:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:05:31,518 INFO L225 Difference]: With dead ends: 640 [2022-04-06 11:05:31,518 INFO L226 Difference]: Without dead ends: 630 [2022-04-06 11:05:31,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-06 11:05:31,519 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 205 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:05:31,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 402 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 11:05:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-04-06 11:05:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-04-06 11:05:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-06 11:05:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 631 transitions. [2022-04-06 11:05:31,568 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 631 transitions. Word has length 297 [2022-04-06 11:05:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:05:31,569 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 631 transitions. [2022-04-06 11:05:31,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-06 11:05:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-06 11:05:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2022-04-06 11:05:31,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:05:31,577 INFO L499 BasicCegarLoop]: trace histogram [112, 111, 111, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:05:31,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-06 11:05:31,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:05:31,782 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:05:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:05:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 3134423, now seen corresponding path program 4 times [2022-04-06 11:05:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:05:31,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361696916] [2022-04-06 11:05:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:05:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:05:31,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:05:31,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71681139] [2022-04-06 11:05:31,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 11:05:31,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:05:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:05:31,803 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:05:31,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-06 11:05:32,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 11:05:32,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:05:32,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-06 11:05:32,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:05:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-04-06 11:05:33,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:05:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-04-06 11:05:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:05:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361696916] [2022-04-06 11:05:34,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:05:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71681139] [2022-04-06 11:05:34,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71681139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:05:34,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:05:34,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-06 11:05:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077941888] [2022-04-06 11:05:34,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:05:34,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-06 11:05:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:05:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-06 11:05:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-06 11:05:34,662 INFO L87 Difference]: Start difference. First operand 630 states and 631 transitions. Second operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-06 11:05:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:05:36,769 INFO L93 Difference]: Finished difference Result 1312 states and 1336 transitions. [2022-04-06 11:05:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-06 11:05:36,770 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) Word has length 633 [2022-04-06 11:05:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:05:36,774 INFO L225 Difference]: With dead ends: 1312 [2022-04-06 11:05:36,774 INFO L226 Difference]: Without dead ends: 1302 [2022-04-06 11:05:36,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-06 11:05:36,777 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 737 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1029 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1029 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:05:36,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [737 Valid, 702 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1029 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-06 11:05:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-06 11:05:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2022-04-06 11:05:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-06 11:05:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1303 transitions. [2022-04-06 11:05:36,874 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1303 transitions. Word has length 633 [2022-04-06 11:05:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:05:36,876 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 1303 transitions. [2022-04-06 11:05:36,876 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-06 11:05:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-06 11:05:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2022-04-06 11:05:36,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:05:36,887 INFO L499 BasicCegarLoop]: trace histogram [232, 231, 231, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:05:36,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-06 11:05:37,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:05:37,106 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:05:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:05:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash -624487321, now seen corresponding path program 5 times [2022-04-06 11:05:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:05:37,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505035386] [2022-04-06 11:05:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:05:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:05:37,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:05:37,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979652090] [2022-04-06 11:05:37,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-06 11:05:37,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:05:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:05:37,155 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:05:37,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-06 11:05:46,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-04-06 11:05:46,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:05:46,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-06 11:05:47,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:05:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-04-06 11:05:49,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:05:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-04-06 11:05:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:05:53,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505035386] [2022-04-06 11:05:53,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:05:53,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979652090] [2022-04-06 11:05:53,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979652090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:05:53,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:05:53,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-04-06 11:05:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565638896] [2022-04-06 11:05:53,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:05:53,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-06 11:05:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:05:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-06 11:05:53,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-04-06 11:05:53,402 INFO L87 Difference]: Start difference. First operand 1302 states and 1303 transitions. Second operand has 98 states, 98 states have (on average 4.408163265306122) internal successors, (432), 98 states have internal predecessors, (432), 96 states have call successors, (466), 50 states have call predecessors, (466), 50 states have return successors, (464), 95 states have call predecessors, (464), 94 states have call successors, (464) [2022-04-06 11:06:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:06:00,318 INFO L93 Difference]: Finished difference Result 2656 states and 2704 transitions. [2022-04-06 11:06:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-04-06 11:06:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.408163265306122) internal successors, (432), 98 states have internal predecessors, (432), 96 states have call successors, (466), 50 states have call predecessors, (466), 50 states have return successors, (464), 95 states have call predecessors, (464), 94 states have call successors, (464) Word has length 1305 [2022-04-06 11:06:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:06:00,328 INFO L225 Difference]: With dead ends: 2656 [2022-04-06 11:06:00,328 INFO L226 Difference]: Without dead ends: 2646 [2022-04-06 11:06:00,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2702 GetRequests, 2513 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2022-04-06 11:06:00,335 INFO L913 BasicCegarLoop]: 491 mSDtfsCounter, 1757 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 2538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 5072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2538 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:06:00,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1757 Valid, 1410 Invalid, 5072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2538 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 11:06:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2022-04-06 11:06:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2646. [2022-04-06 11:06:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 1700 states have (on average 1.0005882352941176) internal successors, (1701), 1700 states have internal predecessors, (1701), 474 states have call successors, (474), 473 states have call predecessors, (474), 471 states have return successors, (472), 472 states have call predecessors, (472), 472 states have call successors, (472) [2022-04-06 11:06:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 2647 transitions. [2022-04-06 11:06:00,539 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 2647 transitions. Word has length 1305 [2022-04-06 11:06:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:06:00,540 INFO L478 AbstractCegarLoop]: Abstraction has 2646 states and 2647 transitions. [2022-04-06 11:06:00,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.408163265306122) internal successors, (432), 98 states have internal predecessors, (432), 96 states have call successors, (466), 50 states have call predecessors, (466), 50 states have return successors, (464), 95 states have call predecessors, (464), 94 states have call successors, (464) [2022-04-06 11:06:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 2647 transitions. [2022-04-06 11:06:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2650 [2022-04-06 11:06:00,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:06:00,578 INFO L499 BasicCegarLoop]: trace histogram [472, 471, 471, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:06:00,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-06 11:06:00,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:06:00,787 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:06:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:06:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1861495417, now seen corresponding path program 6 times [2022-04-06 11:06:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:06:00,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399021824] [2022-04-06 11:06:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:06:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:06:00,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:06:00,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088174590] [2022-04-06 11:06:00,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-06 11:06:00,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:06:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:06:00,831 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:06:00,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-06 11:07:14,409 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 328 check-sat command(s) [2022-04-06 11:07:14,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:07:14,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 5599 conjuncts, 193 conjunts are in the unsatisfiable core [2022-04-06 11:07:14,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:07:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 478838 backedges. 2820 proven. 472256 refuted. 0 times theorem prover too weak. 3762 trivial. 0 not checked. [2022-04-06 11:07:22,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:07:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 478838 backedges. 942 proven. 35156 refuted. 0 times theorem prover too weak. 442740 trivial. 0 not checked. [2022-04-06 11:07:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:07:26,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399021824] [2022-04-06 11:07:26,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:07:26,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088174590] [2022-04-06 11:07:26,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088174590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:07:26,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:07:26,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 104 [2022-04-06 11:07:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440397128] [2022-04-06 11:07:26,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:07:26,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-04-06 11:07:26,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:07:26,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-04-06 11:07:26,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-04-06 11:07:26,585 INFO L87 Difference]: Start difference. First operand 2646 states and 2647 transitions. Second operand has 104 states, 104 states have (on average 5.740384615384615) internal successors, (597), 104 states have internal predecessors, (597), 102 states have call successors, (946), 97 states have call predecessors, (946), 97 states have return successors, (944), 101 states have call predecessors, (944), 101 states have call successors, (944) [2022-04-06 11:07:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:07:33,298 INFO L93 Difference]: Finished difference Result 2824 states and 2830 transitions. [2022-04-06 11:07:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-04-06 11:07:33,299 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.740384615384615) internal successors, (597), 104 states have internal predecessors, (597), 102 states have call successors, (946), 97 states have call predecessors, (946), 97 states have return successors, (944), 101 states have call predecessors, (944), 101 states have call successors, (944) Word has length 2649 [2022-04-06 11:07:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:07:33,308 INFO L225 Difference]: With dead ends: 2824 [2022-04-06 11:07:33,308 INFO L226 Difference]: Without dead ends: 2814 [2022-04-06 11:07:33,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5396 GetRequests, 5194 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2022-04-06 11:07:33,313 INFO L913 BasicCegarLoop]: 521 mSDtfsCounter, 626 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 3491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 975 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 11:07:33,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 1494 Invalid, 3491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [975 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 11:07:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2022-04-06 11:07:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 2814. [2022-04-06 11:07:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 1808 states have (on average 1.0005530973451326) internal successors, (1809), 1808 states have internal predecessors, (1809), 504 states have call successors, (504), 503 states have call predecessors, (504), 501 states have return successors, (502), 502 states have call predecessors, (502), 502 states have call successors, (502) [2022-04-06 11:07:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 2815 transitions. [2022-04-06 11:07:33,514 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 2815 transitions. Word has length 2649 [2022-04-06 11:07:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:07:33,516 INFO L478 AbstractCegarLoop]: Abstraction has 2814 states and 2815 transitions. [2022-04-06 11:07:33,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.740384615384615) internal successors, (597), 104 states have internal predecessors, (597), 102 states have call successors, (946), 97 states have call predecessors, (946), 97 states have return successors, (944), 101 states have call predecessors, (944), 101 states have call successors, (944) [2022-04-06 11:07:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 2815 transitions. [2022-04-06 11:07:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2818 [2022-04-06 11:07:33,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:07:33,577 INFO L499 BasicCegarLoop]: trace histogram [502, 501, 501, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:07:33,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-06 11:07:33,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-06 11:07:33,781 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:07:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:07:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1048804437, now seen corresponding path program 7 times [2022-04-06 11:07:33,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:07:33,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194114137] [2022-04-06 11:07:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:07:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:07:33,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:07:33,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783557836] [2022-04-06 11:07:33,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-06 11:07:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:07:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:07:33,819 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:07:33,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-06 11:07:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 11:07:34,908 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 11:07:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 11:07:36,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 11:07:36,538 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 11:07:36,538 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 11:07:36,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-06 11:07:36,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-06 11:07:36,750 INFO L719 BasicCegarLoop]: Path program histogram: [7, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-04-06 11:07:36,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 11:07:36,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 11:07:36 BasicIcfg [2022-04-06 11:07:36,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 11:07:36,995 INFO L158 Benchmark]: Toolchain (without parser) took 301501.71ms. Allocated memory was 194.0MB in the beginning and 336.6MB in the end (delta: 142.6MB). Free memory was 143.6MB in the beginning and 73.7MB in the end (delta: 69.9MB). Peak memory consumption was 224.3MB. Max. memory is 8.0GB. [2022-04-06 11:07:36,995 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 194.0MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 11:07:36,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.82ms. Allocated memory is still 194.0MB. Free memory was 143.4MB in the beginning and 170.1MB in the end (delta: -26.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 11:07:36,995 INFO L158 Benchmark]: Boogie Preprocessor took 39.77ms. Allocated memory is still 194.0MB. Free memory was 170.1MB in the beginning and 168.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 11:07:36,996 INFO L158 Benchmark]: RCFGBuilder took 271.76ms. Allocated memory is still 194.0MB. Free memory was 168.5MB in the beginning and 157.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 11:07:36,997 INFO L158 Benchmark]: IcfgTransformer took 40.93ms. Allocated memory is still 194.0MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 11:07:36,997 INFO L158 Benchmark]: TraceAbstraction took 300957.82ms. Allocated memory was 194.0MB in the beginning and 336.6MB in the end (delta: 142.6MB). Free memory was 155.4MB in the beginning and 73.7MB in the end (delta: 81.7MB). Peak memory consumption was 236.2MB. Max. memory is 8.0GB. [2022-04-06 11:07:37,001 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 194.0MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.82ms. Allocated memory is still 194.0MB. Free memory was 143.4MB in the beginning and 170.1MB in the end (delta: -26.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.77ms. Allocated memory is still 194.0MB. Free memory was 170.1MB in the beginning and 168.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.76ms. Allocated memory is still 194.0MB. Free memory was 168.5MB in the beginning and 157.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 40.93ms. Allocated memory is still 194.0MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 300957.82ms. Allocated memory was 194.0MB in the beginning and 336.6MB in the end (delta: 142.6MB). Free memory was 155.4MB in the beginning and 73.7MB in the end (delta: 81.7MB). Peak memory consumption was 236.2MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=104, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=100, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=21, n=20, x=8000, y=1261, z=126] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=21, n=20, x=8000, y=1261, z=126] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=21, n=20, x=8000, y=1261, z=126] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=21, n=20, x=8000, y=1261, z=126] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=22, counter++=21, n=21, x=9261, y=1387, z=132] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=22, n=21, x=9261, y=1387, z=132] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=22, n=21, x=9261, y=1387, z=132] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=22, n=21, x=9261, y=1387, z=132] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=22, n=21, x=9261, y=1387, z=132] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=23, counter++=22, n=22, x=10648, y=1519, z=138] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=23, n=22, x=10648, y=1519, z=138] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=23, n=22, x=10648, y=1519, z=138] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=23, n=22, x=10648, y=1519, z=138] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=23, n=22, x=10648, y=1519, z=138] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=24, counter++=23, n=23, x=12167, y=1657, z=144] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=24, n=23, x=12167, y=1657, z=144] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=24, n=23, x=12167, y=1657, z=144] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=24, n=23, x=12167, y=1657, z=144] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=24, n=23, x=12167, y=1657, z=144] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=25, counter++=24, n=24, x=13824, y=1801, z=150] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=25, n=24, x=13824, y=1801, z=150] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=25, n=24, x=13824, y=1801, z=150] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=25, n=24, x=13824, y=1801, z=150] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=25, n=24, x=13824, y=1801, z=150] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=26, counter++=25, n=25, x=15625, y=1951, z=156] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=26, n=25, x=15625, y=1951, z=156] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=26, n=25, x=15625, y=1951, z=156] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=26, n=25, x=15625, y=1951, z=156] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=26, n=25, x=15625, y=1951, z=156] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=27, counter++=26, n=26, x=17576, y=2107, z=162] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=27, n=26, x=17576, y=2107, z=162] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=27, n=26, x=17576, y=2107, z=162] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=27, n=26, x=17576, y=2107, z=162] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=27, n=26, x=17576, y=2107, z=162] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=28, counter++=27, n=27, x=19683, y=2269, z=168] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=28, n=27, x=19683, y=2269, z=168] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=28, n=27, x=19683, y=2269, z=168] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=28, n=27, x=19683, y=2269, z=168] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=28, n=27, x=19683, y=2269, z=168] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=29, counter++=28, n=28, x=21952, y=2437, z=174] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=29, n=28, x=21952, y=2437, z=174] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=29, n=28, x=21952, y=2437, z=174] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=29, n=28, x=21952, y=2437, z=174] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=29, n=28, x=21952, y=2437, z=174] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=30, counter++=29, n=29, x=24389, y=2611, z=180] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=30, n=29, x=24389, y=2611, z=180] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=30, n=29, x=24389, y=2611, z=180] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=30, n=29, x=24389, y=2611, z=180] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=30, n=29, x=24389, y=2611, z=180] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=31, counter++=30, n=30, x=27000, y=2791, z=186] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=31, n=30, x=27000, y=2791, z=186] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=31, n=30, x=27000, y=2791, z=186] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=31, n=30, x=27000, y=2791, z=186] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=31, n=30, x=27000, y=2791, z=186] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=32, counter++=31, n=31, x=29791, y=2977, z=192] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=32, n=31, x=29791, y=2977, z=192] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=32, n=31, x=29791, y=2977, z=192] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=32, n=31, x=29791, y=2977, z=192] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=32, n=31, x=29791, y=2977, z=192] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=33, counter++=32, n=32, x=32768, y=3169, z=198] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=33, n=32, x=32768, y=3169, z=198] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=33, n=32, x=32768, y=3169, z=198] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=33, n=32, x=32768, y=3169, z=198] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=33, n=32, x=32768, y=3169, z=198] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=34, counter++=33, n=33, x=35937, y=3367, z=204] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=34, n=33, x=35937, y=3367, z=204] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=34, n=33, x=35937, y=3367, z=204] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=34, n=33, x=35937, y=3367, z=204] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=34, n=33, x=35937, y=3367, z=204] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=35, counter++=34, n=34, x=39304, y=3571, z=210] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=35, n=34, x=39304, y=3571, z=210] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=35, n=34, x=39304, y=3571, z=210] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=35, n=34, x=39304, y=3571, z=210] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=35, n=34, x=39304, y=3571, z=210] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=36, counter++=35, n=35, x=42875, y=3781, z=216] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=36, n=35, x=42875, y=3781, z=216] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=36, n=35, x=42875, y=3781, z=216] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=36, n=35, x=42875, y=3781, z=216] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=36, n=35, x=42875, y=3781, z=216] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=37, counter++=36, n=36, x=46656, y=3997, z=222] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=37, n=36, x=46656, y=3997, z=222] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=37, n=36, x=46656, y=3997, z=222] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=37, n=36, x=46656, y=3997, z=222] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=37, n=36, x=46656, y=3997, z=222] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=38, counter++=37, n=37, x=50653, y=4219, z=228] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=38, n=37, x=50653, y=4219, z=228] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=38, n=37, x=50653, y=4219, z=228] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=38, n=37, x=50653, y=4219, z=228] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=38, n=37, x=50653, y=4219, z=228] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=39, counter++=38, n=38, x=54872, y=4447, z=234] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=39, n=38, x=54872, y=4447, z=234] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=39, n=38, x=54872, y=4447, z=234] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=39, n=38, x=54872, y=4447, z=234] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=39, n=38, x=54872, y=4447, z=234] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=40, counter++=39, n=39, x=59319, y=4681, z=240] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=40, n=39, x=59319, y=4681, z=240] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=40, n=39, x=59319, y=4681, z=240] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=40, n=39, x=59319, y=4681, z=240] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=40, n=39, x=59319, y=4681, z=240] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=41, counter++=40, n=40, x=64000, y=4921, z=246] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=41, n=40, x=64000, y=4921, z=246] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=41, n=40, x=64000, y=4921, z=246] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=41, n=40, x=64000, y=4921, z=246] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=41, n=40, x=64000, y=4921, z=246] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=42, counter++=41, n=41, x=68921, y=5167, z=252] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=42, n=41, x=68921, y=5167, z=252] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=42, n=41, x=68921, y=5167, z=252] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=42, n=41, x=68921, y=5167, z=252] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=42, n=41, x=68921, y=5167, z=252] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=43, counter++=42, n=42, x=74088, y=5419, z=258] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=43, n=42, x=74088, y=5419, z=258] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=43, n=42, x=74088, y=5419, z=258] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=43, n=42, x=74088, y=5419, z=258] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=43, n=42, x=74088, y=5419, z=258] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=44, counter++=43, n=43, x=79507, y=5677, z=264] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=44, n=43, x=79507, y=5677, z=264] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=44, n=43, x=79507, y=5677, z=264] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=44, n=43, x=79507, y=5677, z=264] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=44, n=43, x=79507, y=5677, z=264] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=45, counter++=44, n=44, x=85184, y=5941, z=270] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=45, n=44, x=85184, y=5941, z=270] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=45, n=44, x=85184, y=5941, z=270] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=45, n=44, x=85184, y=5941, z=270] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=45, n=44, x=85184, y=5941, z=270] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=46, counter++=45, n=45, x=91125, y=6211, z=276] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=46, n=45, x=91125, y=6211, z=276] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=46, n=45, x=91125, y=6211, z=276] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=46, n=45, x=91125, y=6211, z=276] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=46, n=45, x=91125, y=6211, z=276] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=47, counter++=46, n=46, x=97336, y=6487, z=282] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=47, n=46, x=97336, y=6487, z=282] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=47, n=46, x=97336, y=6487, z=282] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=47, n=46, x=97336, y=6487, z=282] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=47, n=46, x=97336, y=6487, z=282] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=48, counter++=47, n=47, x=103823, y=6769, z=288] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=48, n=47, x=103823, y=6769, z=288] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=48, n=47, x=103823, y=6769, z=288] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=48, n=47, x=103823, y=6769, z=288] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=48, n=47, x=103823, y=6769, z=288] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=49, counter++=48, n=48, x=110592, y=7057, z=294] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=49, n=48, x=110592, y=7057, z=294] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=49, n=48, x=110592, y=7057, z=294] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=49, n=48, x=110592, y=7057, z=294] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=49, n=48, x=110592, y=7057, z=294] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=50, counter++=49, n=49, x=117649, y=7351, z=300] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=50, n=49, x=117649, y=7351, z=300] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=50, n=49, x=117649, y=7351, z=300] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=50, n=49, x=117649, y=7351, z=300] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=50, n=49, x=117649, y=7351, z=300] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=51, counter++=50, n=50, x=125000, y=7651, z=306] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=51, n=50, x=125000, y=7651, z=306] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=51, n=50, x=125000, y=7651, z=306] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=51, n=50, x=125000, y=7651, z=306] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=51, n=50, x=125000, y=7651, z=306] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=51, n=50, x=125000, y=7651, z=306] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=51, n=51, x=132651, y=7957, z=312] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=52, counter++=51, n=51, x=132651, y=7957, z=312] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=52, n=51, x=132651, y=7957, z=312] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=52, n=51, x=132651, y=7957, z=312] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=52, n=51, x=132651, y=7957, z=312] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=52, n=51, x=132651, y=7957, z=312] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=52, n=51, x=132651, y=7957, z=312] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=52, n=52, x=140608, y=8269, z=318] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=53, counter++=52, n=52, x=140608, y=8269, z=318] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=53, n=52, x=140608, y=8269, z=318] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=53, n=52, x=140608, y=8269, z=318] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=53, n=52, x=140608, y=8269, z=318] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=53, n=52, x=140608, y=8269, z=318] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=53, n=52, x=140608, y=8269, z=318] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=53, n=53, x=148877, y=8587, z=324] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=54, counter++=53, n=53, x=148877, y=8587, z=324] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=54, n=53, x=148877, y=8587, z=324] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=54, n=53, x=148877, y=8587, z=324] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=54, n=53, x=148877, y=8587, z=324] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=54, n=53, x=148877, y=8587, z=324] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=54, n=53, x=148877, y=8587, z=324] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=54, n=54, x=157464, y=8911, z=330] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=55, counter++=54, n=54, x=157464, y=8911, z=330] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=55, n=54, x=157464, y=8911, z=330] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=55, n=54, x=157464, y=8911, z=330] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=55, n=54, x=157464, y=8911, z=330] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=55, n=54, x=157464, y=8911, z=330] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=55, n=54, x=157464, y=8911, z=330] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=55, n=55, x=166375, y=9241, z=336] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=56, counter++=55, n=55, x=166375, y=9241, z=336] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=56, n=55, x=166375, y=9241, z=336] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=56, n=55, x=166375, y=9241, z=336] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=56, n=55, x=166375, y=9241, z=336] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=56, n=55, x=166375, y=9241, z=336] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=56, n=55, x=166375, y=9241, z=336] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=56, n=56, x=175616, y=9577, z=342] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=57, counter++=56, n=56, x=175616, y=9577, z=342] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=57, n=56, x=175616, y=9577, z=342] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=57, n=56, x=175616, y=9577, z=342] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=57, n=56, x=175616, y=9577, z=342] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=57, n=56, x=175616, y=9577, z=342] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=57, n=56, x=175616, y=9577, z=342] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=57, n=57, x=185193, y=9919, z=348] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=58, counter++=57, n=57, x=185193, y=9919, z=348] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=58, n=57, x=185193, y=9919, z=348] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=58, n=57, x=185193, y=9919, z=348] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=58, n=57, x=185193, y=9919, z=348] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=58, n=57, x=185193, y=9919, z=348] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=58, n=57, x=185193, y=9919, z=348] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=58, n=58, x=195112, y=10267, z=354] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=59, counter++=58, n=58, x=195112, y=10267, z=354] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=59, n=58, x=195112, y=10267, z=354] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=59, n=58, x=195112, y=10267, z=354] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=59, n=58, x=195112, y=10267, z=354] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=59, n=58, x=195112, y=10267, z=354] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=59, n=58, x=195112, y=10267, z=354] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=59, n=59, x=205379, y=10621, z=360] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=60, counter++=59, n=59, x=205379, y=10621, z=360] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=60, n=59, x=205379, y=10621, z=360] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=60, n=59, x=205379, y=10621, z=360] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=60, n=59, x=205379, y=10621, z=360] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=60, n=59, x=205379, y=10621, z=360] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=60, n=59, x=205379, y=10621, z=360] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=60, n=60, x=216000, y=10981, z=366] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=61, counter++=60, n=60, x=216000, y=10981, z=366] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=61, n=60, x=216000, y=10981, z=366] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=61, n=60, x=216000, y=10981, z=366] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=61, n=60, x=216000, y=10981, z=366] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=61, n=60, x=216000, y=10981, z=366] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=61, n=60, x=216000, y=10981, z=366] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=61, n=61, x=226981, y=11347, z=372] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=62, counter++=61, n=61, x=226981, y=11347, z=372] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=62, n=61, x=226981, y=11347, z=372] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=62, n=61, x=226981, y=11347, z=372] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=62, n=61, x=226981, y=11347, z=372] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=62, n=61, x=226981, y=11347, z=372] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=62, n=61, x=226981, y=11347, z=372] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=62, n=62, x=238328, y=11719, z=378] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=63, counter++=62, n=62, x=238328, y=11719, z=378] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=63, n=62, x=238328, y=11719, z=378] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=63, n=62, x=238328, y=11719, z=378] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=63, n=62, x=238328, y=11719, z=378] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=63, n=62, x=238328, y=11719, z=378] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=63, n=62, x=238328, y=11719, z=378] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=63, n=63, x=250047, y=12097, z=384] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=64, counter++=63, n=63, x=250047, y=12097, z=384] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=64, n=63, x=250047, y=12097, z=384] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=64, n=63, x=250047, y=12097, z=384] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=64, n=63, x=250047, y=12097, z=384] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=64, n=63, x=250047, y=12097, z=384] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=64, n=63, x=250047, y=12097, z=384] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=64, n=64, x=262144, y=12481, z=390] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=65, counter++=64, n=64, x=262144, y=12481, z=390] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=65, n=64, x=262144, y=12481, z=390] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=65, n=64, x=262144, y=12481, z=390] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=65, n=64, x=262144, y=12481, z=390] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=65, n=64, x=262144, y=12481, z=390] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=65, n=64, x=262144, y=12481, z=390] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=65, n=65, x=274625, y=12871, z=396] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=66, counter++=65, n=65, x=274625, y=12871, z=396] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=66, n=65, x=274625, y=12871, z=396] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=66, n=65, x=274625, y=12871, z=396] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=66, n=65, x=274625, y=12871, z=396] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=66, n=65, x=274625, y=12871, z=396] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=66, n=65, x=274625, y=12871, z=396] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=66, n=66, x=287496, y=13267, z=402] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=67, counter++=66, n=66, x=287496, y=13267, z=402] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=67, n=66, x=287496, y=13267, z=402] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=67, n=66, x=287496, y=13267, z=402] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=67, n=66, x=287496, y=13267, z=402] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=67, n=66, x=287496, y=13267, z=402] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=67, n=66, x=287496, y=13267, z=402] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=67, n=67, x=300763, y=13669, z=408] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=68, counter++=67, n=67, x=300763, y=13669, z=408] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=68, n=67, x=300763, y=13669, z=408] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=68, n=67, x=300763, y=13669, z=408] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=68, n=67, x=300763, y=13669, z=408] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=68, n=67, x=300763, y=13669, z=408] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=68, n=67, x=300763, y=13669, z=408] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=68, n=68, x=314432, y=14077, z=414] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=69, counter++=68, n=68, x=314432, y=14077, z=414] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=69, n=68, x=314432, y=14077, z=414] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=69, n=68, x=314432, y=14077, z=414] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=69, n=68, x=314432, y=14077, z=414] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=69, n=68, x=314432, y=14077, z=414] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=69, n=68, x=314432, y=14077, z=414] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=69, n=69, x=328509, y=14491, z=420] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=70, counter++=69, n=69, x=328509, y=14491, z=420] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=70, n=69, x=328509, y=14491, z=420] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=70, n=69, x=328509, y=14491, z=420] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=70, n=69, x=328509, y=14491, z=420] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=70, n=69, x=328509, y=14491, z=420] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=70, n=69, x=328509, y=14491, z=420] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=70, n=70, x=343000, y=14911, z=426] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=71, counter++=70, n=70, x=343000, y=14911, z=426] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=71, n=70, x=343000, y=14911, z=426] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=71, n=70, x=343000, y=14911, z=426] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=71, n=70, x=343000, y=14911, z=426] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=71, n=70, x=343000, y=14911, z=426] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=71, n=70, x=343000, y=14911, z=426] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=71, n=71, x=357911, y=15337, z=432] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=72, counter++=71, n=71, x=357911, y=15337, z=432] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=72, n=71, x=357911, y=15337, z=432] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=72, n=71, x=357911, y=15337, z=432] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=72, n=71, x=357911, y=15337, z=432] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=72, n=71, x=357911, y=15337, z=432] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=72, n=71, x=357911, y=15337, z=432] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=72, n=72, x=373248, y=15769, z=438] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=73, counter++=72, n=72, x=373248, y=15769, z=438] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=73, n=72, x=373248, y=15769, z=438] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=73, n=72, x=373248, y=15769, z=438] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=73, n=72, x=373248, y=15769, z=438] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=73, n=72, x=373248, y=15769, z=438] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=73, n=72, x=373248, y=15769, z=438] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=73, n=73, x=389017, y=16207, z=444] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=74, counter++=73, n=73, x=389017, y=16207, z=444] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=74, n=73, x=389017, y=16207, z=444] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=74, n=73, x=389017, y=16207, z=444] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=74, n=73, x=389017, y=16207, z=444] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=74, n=73, x=389017, y=16207, z=444] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=74, n=73, x=389017, y=16207, z=444] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=74, n=74, x=405224, y=16651, z=450] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=75, counter++=74, n=74, x=405224, y=16651, z=450] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=75, n=74, x=405224, y=16651, z=450] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=75, n=74, x=405224, y=16651, z=450] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=75, n=74, x=405224, y=16651, z=450] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=75, n=74, x=405224, y=16651, z=450] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=75, n=74, x=405224, y=16651, z=450] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=75, n=75, x=421875, y=17101, z=456] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=76, counter++=75, n=75, x=421875, y=17101, z=456] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=76, n=75, x=421875, y=17101, z=456] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=76, n=75, x=421875, y=17101, z=456] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=76, n=75, x=421875, y=17101, z=456] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=76, n=75, x=421875, y=17101, z=456] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=76, n=75, x=421875, y=17101, z=456] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=76, n=76, x=438976, y=17557, z=462] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=77, counter++=76, n=76, x=438976, y=17557, z=462] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=77, n=76, x=438976, y=17557, z=462] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=77, n=76, x=438976, y=17557, z=462] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=77, n=76, x=438976, y=17557, z=462] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=77, n=76, x=438976, y=17557, z=462] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=77, n=76, x=438976, y=17557, z=462] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=77, n=77, x=456533, y=18019, z=468] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=78, counter++=77, n=77, x=456533, y=18019, z=468] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=78, n=77, x=456533, y=18019, z=468] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=78, n=77, x=456533, y=18019, z=468] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=78, n=77, x=456533, y=18019, z=468] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=78, n=77, x=456533, y=18019, z=468] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=78, n=77, x=456533, y=18019, z=468] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=78, n=78, x=474552, y=18487, z=474] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=79, counter++=78, n=78, x=474552, y=18487, z=474] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=79, n=78, x=474552, y=18487, z=474] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=79, n=78, x=474552, y=18487, z=474] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=79, n=78, x=474552, y=18487, z=474] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=79, n=78, x=474552, y=18487, z=474] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=79, n=78, x=474552, y=18487, z=474] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=79, n=79, x=493039, y=18961, z=480] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=80, counter++=79, n=79, x=493039, y=18961, z=480] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=80, n=79, x=493039, y=18961, z=480] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=80, n=79, x=493039, y=18961, z=480] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=80, n=79, x=493039, y=18961, z=480] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=80, n=79, x=493039, y=18961, z=480] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=80, n=79, x=493039, y=18961, z=480] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=80, n=80, x=512000, y=19441, z=486] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=81, counter++=80, n=80, x=512000, y=19441, z=486] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=81, n=80, x=512000, y=19441, z=486] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=81, n=80, x=512000, y=19441, z=486] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=81, n=80, x=512000, y=19441, z=486] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=81, n=80, x=512000, y=19441, z=486] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=81, n=80, x=512000, y=19441, z=486] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=81, n=81, x=531441, y=19927, z=492] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=82, counter++=81, n=81, x=531441, y=19927, z=492] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=82, n=81, x=531441, y=19927, z=492] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=82, n=81, x=531441, y=19927, z=492] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=82, n=81, x=531441, y=19927, z=492] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=82, n=81, x=531441, y=19927, z=492] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=82, n=81, x=531441, y=19927, z=492] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=82, n=82, x=551368, y=20419, z=498] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=83, counter++=82, n=82, x=551368, y=20419, z=498] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=83, n=82, x=551368, y=20419, z=498] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=83, n=82, x=551368, y=20419, z=498] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=83, n=82, x=551368, y=20419, z=498] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=83, n=82, x=551368, y=20419, z=498] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=83, n=82, x=551368, y=20419, z=498] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=83, n=83, x=571787, y=20917, z=504] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=84, counter++=83, n=83, x=571787, y=20917, z=504] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=84, n=83, x=571787, y=20917, z=504] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=84, n=83, x=571787, y=20917, z=504] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=84, n=83, x=571787, y=20917, z=504] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=84, n=83, x=571787, y=20917, z=504] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=84, n=83, x=571787, y=20917, z=504] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=84, n=84, x=592704, y=21421, z=510] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=85, counter++=84, n=84, x=592704, y=21421, z=510] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=85, n=84, x=592704, y=21421, z=510] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=85, n=84, x=592704, y=21421, z=510] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=85, n=84, x=592704, y=21421, z=510] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=85, n=84, x=592704, y=21421, z=510] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=85, n=84, x=592704, y=21421, z=510] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=85, n=85, x=614125, y=21931, z=516] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=86, counter++=85, n=85, x=614125, y=21931, z=516] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=86, n=85, x=614125, y=21931, z=516] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=86, n=85, x=614125, y=21931, z=516] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=86, n=85, x=614125, y=21931, z=516] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=86, n=85, x=614125, y=21931, z=516] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=86, n=85, x=614125, y=21931, z=516] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=86, n=86, x=636056, y=22447, z=522] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=87, counter++=86, n=86, x=636056, y=22447, z=522] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=87, n=86, x=636056, y=22447, z=522] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=87, n=86, x=636056, y=22447, z=522] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=87, n=86, x=636056, y=22447, z=522] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=87, n=86, x=636056, y=22447, z=522] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=87, n=86, x=636056, y=22447, z=522] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=87, n=87, x=658503, y=22969, z=528] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=88, counter++=87, n=87, x=658503, y=22969, z=528] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=88, n=87, x=658503, y=22969, z=528] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=88, n=87, x=658503, y=22969, z=528] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=88, n=87, x=658503, y=22969, z=528] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=88, n=87, x=658503, y=22969, z=528] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=88, n=87, x=658503, y=22969, z=528] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=88, n=88, x=681472, y=23497, z=534] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=89, counter++=88, n=88, x=681472, y=23497, z=534] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=89, n=88, x=681472, y=23497, z=534] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=89, n=88, x=681472, y=23497, z=534] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=89, n=88, x=681472, y=23497, z=534] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=89, n=88, x=681472, y=23497, z=534] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=89, n=88, x=681472, y=23497, z=534] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=89, n=89, x=704969, y=24031, z=540] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=90, counter++=89, n=89, x=704969, y=24031, z=540] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=90, n=89, x=704969, y=24031, z=540] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=90, n=89, x=704969, y=24031, z=540] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=90, n=89, x=704969, y=24031, z=540] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=90, n=89, x=704969, y=24031, z=540] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=90, n=89, x=704969, y=24031, z=540] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=90, n=90, x=729000, y=24571, z=546] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=91, counter++=90, n=90, x=729000, y=24571, z=546] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=91, n=90, x=729000, y=24571, z=546] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=91, n=90, x=729000, y=24571, z=546] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=91, n=90, x=729000, y=24571, z=546] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=91, n=90, x=729000, y=24571, z=546] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=91, n=90, x=729000, y=24571, z=546] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=91, n=91, x=753571, y=25117, z=552] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=92, counter++=91, n=91, x=753571, y=25117, z=552] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=92, n=91, x=753571, y=25117, z=552] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=92, n=91, x=753571, y=25117, z=552] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=92, n=91, x=753571, y=25117, z=552] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=92, n=91, x=753571, y=25117, z=552] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=92, n=91, x=753571, y=25117, z=552] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=92, n=92, x=778688, y=25669, z=558] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=93, counter++=92, n=92, x=778688, y=25669, z=558] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=93, n=92, x=778688, y=25669, z=558] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=93, n=92, x=778688, y=25669, z=558] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=93, n=92, x=778688, y=25669, z=558] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=93, n=92, x=778688, y=25669, z=558] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=93, n=92, x=778688, y=25669, z=558] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=93, n=93, x=804357, y=26227, z=564] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=94, counter++=93, n=93, x=804357, y=26227, z=564] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=94, n=93, x=804357, y=26227, z=564] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=94, n=93, x=804357, y=26227, z=564] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=94, n=93, x=804357, y=26227, z=564] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=94, n=93, x=804357, y=26227, z=564] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=94, n=93, x=804357, y=26227, z=564] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=94, n=94, x=830584, y=26791, z=570] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=95, counter++=94, n=94, x=830584, y=26791, z=570] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=95, n=94, x=830584, y=26791, z=570] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=95, n=94, x=830584, y=26791, z=570] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=95, n=94, x=830584, y=26791, z=570] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=95, n=94, x=830584, y=26791, z=570] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=95, n=94, x=830584, y=26791, z=570] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=95, n=95, x=857375, y=27361, z=576] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=96, counter++=95, n=95, x=857375, y=27361, z=576] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=96, n=95, x=857375, y=27361, z=576] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=96, n=95, x=857375, y=27361, z=576] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=96, n=95, x=857375, y=27361, z=576] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=96, n=95, x=857375, y=27361, z=576] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=96, n=95, x=857375, y=27361, z=576] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=96, n=96, x=884736, y=27937, z=582] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=97, counter++=96, n=96, x=884736, y=27937, z=582] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=97, n=96, x=884736, y=27937, z=582] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=97, n=96, x=884736, y=27937, z=582] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=97, n=96, x=884736, y=27937, z=582] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=97, n=96, x=884736, y=27937, z=582] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=97, n=96, x=884736, y=27937, z=582] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=97, n=97, x=912673, y=28519, z=588] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=98, counter++=97, n=97, x=912673, y=28519, z=588] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=98, n=97, x=912673, y=28519, z=588] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=98, n=97, x=912673, y=28519, z=588] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=98, n=97, x=912673, y=28519, z=588] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=98, n=97, x=912673, y=28519, z=588] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=98, n=97, x=912673, y=28519, z=588] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=98, n=98, x=941192, y=29107, z=594] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=99, counter++=98, n=98, x=941192, y=29107, z=594] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=99, n=98, x=941192, y=29107, z=594] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=99, n=98, x=941192, y=29107, z=594] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=99, n=98, x=941192, y=29107, z=594] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=99, n=98, x=941192, y=29107, z=594] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=99, n=98, x=941192, y=29107, z=594] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=99, n=99, x=970299, y=29701, z=600] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=100, counter++=99, n=99, x=970299, y=29701, z=600] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=100, counter=100, n=99, x=970299, y=29701, z=600] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=100, counter=100, n=99, x=970299, y=29701, z=600] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=100, counter=100, n=99, x=970299, y=29701, z=600] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=100, counter=100, n=99, x=970299, y=29701, z=600] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=100, counter=100, n=99, x=970299, y=29701, z=600] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=100, counter=100, n=100, x=1000000, y=30301, z=606] [L33] EXPR counter++ VAL [\old(counter)=0, a=100, counter=101, counter++=100, n=100, x=1000000, y=30301, z=606] [L33] COND FALSE !(counter++<100) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=101] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=101] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=100, counter=101, n=100, x=1000000, y=30301, z=606] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=101] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=101] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 300.7s, OverallIterations: 24, TraceHistogramMax: 502, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 3793 SdHoareTripleChecker+Valid, 38.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3736 mSDsluCounter, 6928 SdHoareTripleChecker+Invalid, 37.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4674 mSDsCounter, 5299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9330 IncrementalHoareTripleChecker+Invalid, 14634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5299 mSolverCounterUnsat, 2254 mSDtfsCounter, 9330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12326 GetRequests, 11592 SyntacticMatches, 21 SemanticMatches, 713 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12339 ImplicationChecksByTransitivity, 34.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2814occurred in iteration=23, InterpolantAutomatonStates: 685, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 89.8s SatisfiabilityAnalysisTime, 139.7s InterpolantComputationTime, 9029 NumberOfCodeBlocks, 8743 NumberOfCodeBlocksAsserted, 554 NumberOfCheckSat, 11848 ConstructedInterpolants, 0 QuantifiedInterpolants, 32160 SizeOfPredicates, 231 NumberOfNonLiveVariables, 13215 ConjunctsInSsa, 717 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 603528/1264670 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-06 11:07:37,033 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...