./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:07:10,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:07:10,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:07:11,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:07:11,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:07:11,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:07:11,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:07:11,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:07:11,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:07:11,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:07:11,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:07:11,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:07:11,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:07:11,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:07:11,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:07:11,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:07:11,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:07:11,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:07:11,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:07:11,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:07:11,037 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:07:11,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:07:11,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:07:11,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:07:11,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:07:11,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:07:11,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:07:11,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:07:11,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:07:11,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:07:11,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:07:11,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:07:11,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:07:11,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:07:11,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:07:11,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:07:11,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:07:11,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:07:11,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:07:11,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:07:11,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:07:11,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:07:11,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 16:07:11,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:07:11,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:07:11,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:07:11,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:07:11,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:07:11,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:07:11,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:07:11,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:07:11,070 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:07:11,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:07:11,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:07:11,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 16:07:11,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:07:11,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:07:11,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:07:11,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:07:11,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:07:11,072 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:07:11,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:07:11,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:07:11,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:07:11,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:07:11,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:07:11,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:07:11,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:07:11,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:07:11,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:07:11,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:07:11,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 16:07:11,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 16:07:11,074 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:07:11,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:07:11,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:07:11,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed [2022-07-13 16:07:11,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:07:11,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:07:11,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:07:11,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:07:11,266 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:07:11,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-07-13 16:07:11,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ca5904d/b970ded9d179446196755f0adee37a89/FLAGd0fb22afe [2022-07-13 16:07:11,657 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:07:11,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-07-13 16:07:11,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ca5904d/b970ded9d179446196755f0adee37a89/FLAGd0fb22afe [2022-07-13 16:07:11,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ca5904d/b970ded9d179446196755f0adee37a89 [2022-07-13 16:07:11,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:07:11,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:07:11,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:07:11,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:07:11,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:07:11,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c975f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11, skipping insertion in model container [2022-07-13 16:07:11,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:07:11,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:07:11,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-07-13 16:07:11,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:07:11,851 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:07:11,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-07-13 16:07:11,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:07:11,883 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:07:11,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11 WrapperNode [2022-07-13 16:07:11,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:07:11,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:07:11,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:07:11,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:07:11,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,918 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-07-13 16:07:11,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:07:11,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:07:11,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:07:11,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:07:11,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:07:11,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:07:11,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:07:11,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:07:11,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (1/1) ... [2022-07-13 16:07:11,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:07:11,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:11,984 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-07-13 16:07:12,002 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-07-13 16:07:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:07:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 16:07:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:07:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:07:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:07:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:07:12,047 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:07:12,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:07:12,168 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:07:12,172 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:07:12,172 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:07:12,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:07:12 BoogieIcfgContainer [2022-07-13 16:07:12,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:07:12,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:07:12,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:07:12,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:07:12,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 04:07:11" (1/3) ... [2022-07-13 16:07:12,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afac75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:07:12, skipping insertion in model container [2022-07-13 16:07:12,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:07:11" (2/3) ... [2022-07-13 16:07:12,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afac75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:07:12, skipping insertion in model container [2022-07-13 16:07:12,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:07:12" (3/3) ... [2022-07-13 16:07:12,178 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-07-13 16:07:12,187 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:07:12,187 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:07:12,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:07:12,221 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4be68b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31fdc5e2 [2022-07-13 16:07:12,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:07:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 16:07:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 16:07:12,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:12,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:12,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:12,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-07-13 16:07:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:12,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35008359] [2022-07-13 16:07:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 16:07:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35008359] [2022-07-13 16:07:12,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35008359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:07:12,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:07:12,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:07:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966174704] [2022-07-13 16:07:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:07:12,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:07:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:12,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:07:12,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:07:12,344 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:07:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:12,364 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-07-13 16:07:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:07:12,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-13 16:07:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:12,373 INFO L225 Difference]: With dead ends: 50 [2022-07-13 16:07:12,373 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 16:07:12,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:07:12,380 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:12,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:07:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 16:07:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-13 16:07:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 16:07:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-07-13 16:07:12,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-07-13 16:07:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:12,411 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-07-13 16:07:12,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:07:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-07-13 16:07:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:07:12,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:12,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:12,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 16:07:12,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-07-13 16:07:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:12,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536520356] [2022-07-13 16:07:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 16:07:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:12,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536520356] [2022-07-13 16:07:12,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536520356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:07:12,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:07:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 16:07:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452991708] [2022-07-13 16:07:12,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:07:12,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:07:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:07:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:07:12,511 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:07:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:12,539 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-07-13 16:07:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:07:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 16:07:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:12,541 INFO L225 Difference]: With dead ends: 36 [2022-07-13 16:07:12,541 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 16:07:12,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:07:12,542 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:12,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:07:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 16:07:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-13 16:07:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 16:07:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-07-13 16:07:12,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-07-13 16:07:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:12,557 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-07-13 16:07:12,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:07:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-07-13 16:07:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:07:12,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:12,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:12,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 16:07:12,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-07-13 16:07:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:12,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143210170] [2022-07-13 16:07:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 16:07:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:12,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143210170] [2022-07-13 16:07:12,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143210170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:07:12,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:07:12,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:07:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304415255] [2022-07-13 16:07:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:07:12,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:07:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:07:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:07:12,663 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:07:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:12,743 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-07-13 16:07:12,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 16:07:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 16:07:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:12,745 INFO L225 Difference]: With dead ends: 30 [2022-07-13 16:07:12,745 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 16:07:12,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07-13 16:07:12,746 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:12,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:07:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 16:07:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-13 16:07:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 16:07:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-07-13 16:07:12,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2022-07-13 16:07:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:12,760 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-13 16:07:12,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:07:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-07-13 16:07:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 16:07:12,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:12,761 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:12,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 16:07:12,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-07-13 16:07:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:12,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330778789] [2022-07-13 16:07:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:12,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:12,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797954762] [2022-07-13 16:07:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:12,787 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-07-13 16:07:12,803 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-07-13 16:07:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:12,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 16:07:12,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 16:07:12,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:07:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:12,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330778789] [2022-07-13 16:07:12,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:12,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797954762] [2022-07-13 16:07:12,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797954762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:07:12,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:07:12,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:07:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563483320] [2022-07-13 16:07:12,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:07:12,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:07:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:12,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:07:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:07:12,940 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 16:07:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:13,009 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-13 16:07:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:07:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-13 16:07:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:13,010 INFO L225 Difference]: With dead ends: 46 [2022-07-13 16:07:13,010 INFO L226 Difference]: Without dead ends: 44 [2022-07-13 16:07:13,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-07-13 16:07:13,011 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:13,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:07:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-13 16:07:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-07-13 16:07:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-13 16:07:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-07-13 16:07:13,020 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2022-07-13 16:07:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:13,020 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-13 16:07:13,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 16:07:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-07-13 16:07:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 16:07:13,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:13,021 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:13,040 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-07-13 16:07:13,240 WARN L477 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-07-13 16:07:13,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:13,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-07-13 16:07:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:13,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797302645] [2022-07-13 16:07:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:13,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:13,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349418205] [2022-07-13 16:07:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:13,251 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-07-13 16:07:13,252 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-07-13 16:07:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:13,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 16:07:13,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:07:13,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:07:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797302645] [2022-07-13 16:07:13,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349418205] [2022-07-13 16:07:13,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349418205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:07:13,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:07:13,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:07:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107763883] [2022-07-13 16:07:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:07:13,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:07:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:13,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:07:13,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:07:13,311 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:07:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:13,356 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-07-13 16:07:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:07:13,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-07-13 16:07:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:13,358 INFO L225 Difference]: With dead ends: 50 [2022-07-13 16:07:13,358 INFO L226 Difference]: Without dead ends: 48 [2022-07-13 16:07:13,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-07-13 16:07:13,359 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 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-07-13 16:07:13,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:07:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-13 16:07:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-07-13 16:07:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 16:07:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-07-13 16:07:13,366 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-07-13 16:07:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:13,367 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-07-13 16:07:13,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:07:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-07-13 16:07:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 16:07:13,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:13,384 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:13,402 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-07-13 16:07:13,599 WARN L477 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-07-13 16:07:13,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-07-13 16:07:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:13,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058182090] [2022-07-13 16:07:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:13,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:13,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523265191] [2022-07-13 16:07:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:13,610 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-07-13 16:07:13,611 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-07-13 16:07:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:13,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 16:07:13,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 16:07:13,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:07:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058182090] [2022-07-13 16:07:13,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523265191] [2022-07-13 16:07:13,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523265191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:07:13,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:07:13,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:07:13,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224995165] [2022-07-13 16:07:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:07:13,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:07:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:07:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:07:13,682 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 16:07:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:13,734 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-13 16:07:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:07:13,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-07-13 16:07:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:13,735 INFO L225 Difference]: With dead ends: 58 [2022-07-13 16:07:13,736 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 16:07:13,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-07-13 16:07:13,736 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:13,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:07:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 16:07:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-13 16:07:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 16:07:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-13 16:07:13,743 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-07-13 16:07:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:13,743 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-13 16:07:13,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 16:07:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-13 16:07:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 16:07:13,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:13,744 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:13,762 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-07-13 16:07:13,959 WARN L477 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-07-13 16:07:13,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-07-13 16:07:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630137103] [2022-07-13 16:07:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:13,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:13,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122478192] [2022-07-13 16:07:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:13,979 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-07-13 16:07:13,980 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-07-13 16:07:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:14,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 16:07:14,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 16:07:14,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 16:07:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630137103] [2022-07-13 16:07:14,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122478192] [2022-07-13 16:07:14,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122478192] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:14,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:14,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-13 16:07:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61067193] [2022-07-13 16:07:14,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:14,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:07:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:07:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:07:14,141 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 16:07:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:14,249 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-07-13 16:07:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 16:07:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2022-07-13 16:07:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:14,253 INFO L225 Difference]: With dead ends: 116 [2022-07-13 16:07:14,254 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 16:07:14,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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-07-13 16:07:14,256 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 65 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:14,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:07:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 16:07:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-13 16:07:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 16:07:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-13 16:07:14,282 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 41 [2022-07-13 16:07:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:14,283 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-13 16:07:14,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 16:07:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-13 16:07:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 16:07:14,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:14,284 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:14,303 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-07-13 16:07:14,499 WARN L477 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-07-13 16:07:14,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 1 times [2022-07-13 16:07:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:14,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249606109] [2022-07-13 16:07:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:14,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589434096] [2022-07-13 16:07:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:14,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:14,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:14,526 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-07-13 16:07:14,527 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-07-13 16:07:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:14,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 16:07:14,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 16:07:14,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 16:07:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:14,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249606109] [2022-07-13 16:07:14,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:14,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589434096] [2022-07-13 16:07:14,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589434096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:14,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:14,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 16:07:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056805555] [2022-07-13 16:07:14,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:07:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:07:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:07:14,770 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 16:07:16,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 16:07:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:16,254 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-07-13 16:07:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:07:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-07-13 16:07:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:16,256 INFO L225 Difference]: With dead ends: 114 [2022-07-13 16:07:16,256 INFO L226 Difference]: Without dead ends: 112 [2022-07-13 16:07:16,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 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-07-13 16:07:16,256 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:16,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 16:07:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-13 16:07:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-13 16:07:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 16:07:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-07-13 16:07:16,272 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2022-07-13 16:07:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:16,272 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-07-13 16:07:16,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 16:07:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-07-13 16:07:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 16:07:16,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:16,273 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:16,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 16:07:16,505 WARN L477 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-07-13 16:07:16,506 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 2 times [2022-07-13 16:07:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:16,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000379064] [2022-07-13 16:07:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:16,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:16,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641059086] [2022-07-13 16:07:16,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:07:16,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:16,516 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-07-13 16:07:16,526 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-07-13 16:07:16,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:07:16,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:16,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 16:07:16,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 16:07:16,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 16:07:16,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000379064] [2022-07-13 16:07:16,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641059086] [2022-07-13 16:07:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641059086] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:16,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:16,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 16:07:16,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67207827] [2022-07-13 16:07:16,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:16,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:07:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:07:16,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:07:16,657 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 16:07:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:16,770 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-07-13 16:07:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 16:07:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-07-13 16:07:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:16,772 INFO L225 Difference]: With dead ends: 118 [2022-07-13 16:07:16,772 INFO L226 Difference]: Without dead ends: 116 [2022-07-13 16:07:16,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 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-07-13 16:07:16,772 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:16,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:07:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-13 16:07:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-13 16:07:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 16:07:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-07-13 16:07:16,785 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 46 [2022-07-13 16:07:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:16,785 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-07-13 16:07:16,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 16:07:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-07-13 16:07:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 16:07:16,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:16,786 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:16,803 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-07-13 16:07:17,003 WARN L477 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-07-13 16:07:17,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 3 times [2022-07-13 16:07:17,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:17,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926916034] [2022-07-13 16:07:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:17,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:17,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37176608] [2022-07-13 16:07:17,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:07:17,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:17,026 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-07-13 16:07:17,027 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-07-13 16:07:17,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 16:07:17,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:17,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 16:07:17,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 16:07:17,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 16:07:17,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926916034] [2022-07-13 16:07:17,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37176608] [2022-07-13 16:07:17,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37176608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:17,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:17,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 16:07:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345236544] [2022-07-13 16:07:17,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:17,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:07:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:07:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:07:17,307 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 16:07:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:17,515 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2022-07-13 16:07:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:07:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-07-13 16:07:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:17,516 INFO L225 Difference]: With dead ends: 142 [2022-07-13 16:07:17,516 INFO L226 Difference]: Without dead ends: 131 [2022-07-13 16:07:17,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 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-07-13 16:07:17,517 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:17,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 16:07:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-13 16:07:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-13 16:07:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-13 16:07:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-07-13 16:07:17,527 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 51 [2022-07-13 16:07:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:17,528 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-07-13 16:07:17,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 16:07:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-07-13 16:07:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 16:07:17,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:17,528 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:17,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 16:07:17,749 WARN L477 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-07-13 16:07:17,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2022-07-13 16:07:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:17,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200743097] [2022-07-13 16:07:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:17,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:17,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837428175] [2022-07-13 16:07:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:17,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:17,757 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-07-13 16:07:17,758 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-07-13 16:07:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:17,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 16:07:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 16:07:18,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200743097] [2022-07-13 16:07:18,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837428175] [2022-07-13 16:07:18,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837428175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:07:18,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 16:07:18,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-07-13 16:07:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205003268] [2022-07-13 16:07:18,881 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:18,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 16:07:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:18,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 16:07:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 16:07:18,882 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 16:07:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:19,241 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-13 16:07:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 16:07:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 67 [2022-07-13 16:07:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:19,243 INFO L225 Difference]: With dead ends: 133 [2022-07-13 16:07:19,243 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 16:07:19,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-13 16:07:19,243 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:19,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 16:07:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 16:07:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 16:07:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-13 16:07:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-13 16:07:19,254 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 67 [2022-07-13 16:07:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:19,254 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-13 16:07:19,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 16:07:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-13 16:07:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 16:07:19,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:19,255 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 16:07:19,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 16:07:19,469 WARN L477 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-07-13 16:07:19,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash -207258189, now seen corresponding path program 4 times [2022-07-13 16:07:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:19,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835139519] [2022-07-13 16:07:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:19,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:19,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030030048] [2022-07-13 16:07:19,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 16:07:19,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:19,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:19,496 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-07-13 16:07:19,500 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-07-13 16:07:20,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 16:07:20,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:20,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 16:07:20,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 61 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-07-13 16:07:21,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 23 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-13 16:07:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:21,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835139519] [2022-07-13 16:07:21,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:21,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030030048] [2022-07-13 16:07:21,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030030048] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:21,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:21,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-07-13 16:07:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128726459] [2022-07-13 16:07:21,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:21,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 16:07:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 16:07:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-13 16:07:21,852 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-13 16:07:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:22,132 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-07-13 16:07:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:07:22,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) Word has length 74 [2022-07-13 16:07:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:22,133 INFO L225 Difference]: With dead ends: 134 [2022-07-13 16:07:22,133 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 16:07:22,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-07-13 16:07:22,134 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:22,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 54 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 16:07:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 16:07:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-07-13 16:07:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-13 16:07:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-13 16:07:22,144 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2022-07-13 16:07:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:22,144 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-13 16:07:22,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-13 16:07:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-13 16:07:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 16:07:22,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:22,147 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:07:22,165 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-07-13 16:07:22,354 WARN L477 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-07-13 16:07:22,354 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash 308615369, now seen corresponding path program 2 times [2022-07-13 16:07:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:22,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082812108] [2022-07-13 16:07:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:22,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:22,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008716632] [2022-07-13 16:07:22,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:07:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:22,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:22,392 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-07-13 16:07:22,401 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-07-13 16:07:22,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:07:22,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:22,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 16:07:22,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-07-13 16:07:22,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:22,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082812108] [2022-07-13 16:07:22,788 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:22,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008716632] [2022-07-13 16:07:22,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008716632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:07:22,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 16:07:22,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-13 16:07:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835915305] [2022-07-13 16:07:22,788 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:22,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:07:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:07:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 16:07:22,789 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 16:07:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:22,941 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-07-13 16:07:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 16:07:22,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 95 [2022-07-13 16:07:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:22,942 INFO L225 Difference]: With dead ends: 134 [2022-07-13 16:07:22,942 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 16:07:22,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-13 16:07:22,943 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:22,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:07:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 16:07:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-13 16:07:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-13 16:07:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-07-13 16:07:22,953 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 95 [2022-07-13 16:07:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:22,953 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-07-13 16:07:22,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 16:07:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-07-13 16:07:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 16:07:22,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:22,954 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:22,973 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-07-13 16:07:23,173 WARN L477 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-07-13 16:07:23,173 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 75049244, now seen corresponding path program 1 times [2022-07-13 16:07:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:23,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062758919] [2022-07-13 16:07:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:23,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:23,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414388917] [2022-07-13 16:07:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:23,181 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-07-13 16:07:23,233 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-07-13 16:07:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:07:23,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 16:07:23,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-07-13 16:07:23,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:23,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:23,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062758919] [2022-07-13 16:07:23,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:23,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414388917] [2022-07-13 16:07:23,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414388917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:07:23,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 16:07:23,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-13 16:07:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480409936] [2022-07-13 16:07:23,573 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:23,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:07:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:07:23,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 16:07:23,574 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 16:07:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:23,703 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-07-13 16:07:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 16:07:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 100 [2022-07-13 16:07:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:23,704 INFO L225 Difference]: With dead ends: 138 [2022-07-13 16:07:23,704 INFO L226 Difference]: Without dead ends: 125 [2022-07-13 16:07:23,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-13 16:07:23,705 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:23,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:07:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-13 16:07:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-13 16:07:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 16:07:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-07-13 16:07:23,715 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 100 [2022-07-13 16:07:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:23,716 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-07-13 16:07:23,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 16:07:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-07-13 16:07:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 16:07:23,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:23,717 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:23,735 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-07-13 16:07:23,933 WARN L477 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-07-13 16:07:23,933 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1859389073, now seen corresponding path program 3 times [2022-07-13 16:07:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824235215] [2022-07-13 16:07:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:23,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711717279] [2022-07-13 16:07:23,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:07:23,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:23,963 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-07-13 16:07:23,965 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-07-13 16:07:24,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 16:07:24,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 16:07:24,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-07-13 16:07:24,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-07-13 16:07:25,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:25,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824235215] [2022-07-13 16:07:25,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:25,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711717279] [2022-07-13 16:07:25,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711717279] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:25,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:25,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-13 16:07:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581604036] [2022-07-13 16:07:25,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:25,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 16:07:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 16:07:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 16:07:25,686 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 16:07:27,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 16:07:28,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 16:07:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:29,013 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2022-07-13 16:07:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 16:07:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 123 [2022-07-13 16:07:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:29,014 INFO L225 Difference]: With dead ends: 134 [2022-07-13 16:07:29,014 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 16:07:29,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-13 16:07:29,014 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:29,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 92 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 16:07:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 16:07:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-13 16:07:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-13 16:07:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-07-13 16:07:29,024 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 123 [2022-07-13 16:07:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:29,024 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-07-13 16:07:29,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 16:07:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-07-13 16:07:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 16:07:29,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:29,025 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:29,051 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-07-13 16:07:29,225 WARN L477 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-07-13 16:07:29,226 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1602424598, now seen corresponding path program 2 times [2022-07-13 16:07:29,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:29,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730201978] [2022-07-13 16:07:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:29,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:29,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:29,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287738254] [2022-07-13 16:07:29,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:07:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:29,260 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-07-13 16:07:29,261 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-07-13 16:07:29,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:07:29,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:29,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 16:07:29,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-13 16:07:29,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-07-13 16:07:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:29,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730201978] [2022-07-13 16:07:29,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:29,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287738254] [2022-07-13 16:07:29,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287738254] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:07:29,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:07:29,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-13 16:07:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027768252] [2022-07-13 16:07:29,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 16:07:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 16:07:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-13 16:07:29,558 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-07-13 16:07:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:29,815 INFO L93 Difference]: Finished difference Result 390 states and 406 transitions. [2022-07-13 16:07:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 16:07:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 125 [2022-07-13 16:07:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:29,817 INFO L225 Difference]: With dead ends: 390 [2022-07-13 16:07:29,817 INFO L226 Difference]: Without dead ends: 365 [2022-07-13 16:07:29,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 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-07-13 16:07:29,818 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 122 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 16:07:29,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 271 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 16:07:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-13 16:07:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 313. [2022-07-13 16:07:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 196 states have (on average 1.0459183673469388) internal successors, (205), 203 states have internal predecessors, (205), 63 states have call successors, (63), 54 states have call predecessors, (63), 53 states have return successors, (61), 55 states have call predecessors, (61), 61 states have call successors, (61) [2022-07-13 16:07:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 329 transitions. [2022-07-13 16:07:29,841 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 329 transitions. Word has length 125 [2022-07-13 16:07:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:29,841 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 329 transitions. [2022-07-13 16:07:29,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-07-13 16:07:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 329 transitions. [2022-07-13 16:07:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 16:07:29,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:29,842 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:29,858 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-07-13 16:07:30,050 WARN L477 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-07-13 16:07:30,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 709017654, now seen corresponding path program 2 times [2022-07-13 16:07:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:30,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802074559] [2022-07-13 16:07:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:30,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:30,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996614401] [2022-07-13 16:07:30,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:07:30,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:30,059 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-07-13 16:07:30,065 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-07-13 16:07:30,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:07:30,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:30,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 16:07:30,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:07:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-07-13 16:07:30,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:07:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:07:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802074559] [2022-07-13 16:07:30,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:07:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996614401] [2022-07-13 16:07:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996614401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:07:30,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 16:07:30,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-07-13 16:07:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302747197] [2022-07-13 16:07:30,492 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 16:07:30,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 16:07:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:07:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 16:07:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-13 16:07:30,493 INFO L87 Difference]: Start difference. First operand 313 states and 329 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-13 16:07:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:07:30,716 INFO L93 Difference]: Finished difference Result 323 states and 338 transitions. [2022-07-13 16:07:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 16:07:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 128 [2022-07-13 16:07:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:07:30,720 INFO L225 Difference]: With dead ends: 323 [2022-07-13 16:07:30,720 INFO L226 Difference]: Without dead ends: 312 [2022-07-13 16:07:30,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 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-07-13 16:07:30,721 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 202 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-07-13 16:07:30,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 202 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 16:07:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-13 16:07:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-13 16:07:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.0408163265306123) internal successors, (204), 202 states have internal predecessors, (204), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-13 16:07:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 326 transitions. [2022-07-13 16:07:30,752 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 326 transitions. Word has length 128 [2022-07-13 16:07:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:07:30,753 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 326 transitions. [2022-07-13 16:07:30,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-13 16:07:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 326 transitions. [2022-07-13 16:07:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 16:07:30,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:07:30,755 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:07:30,771 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-07-13 16:07:30,968 WARN L477 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-07-13 16:07:30,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:07:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:07:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1972302768, now seen corresponding path program 3 times [2022-07-13 16:07:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:07:30,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988232605] [2022-07-13 16:07:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:07:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:07:30,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:07:30,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462426956] [2022-07-13 16:07:30,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:07:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:07:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:07:30,997 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-07-13 16:07:30,999 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-07-13 16:07:32,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 16:07:32,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:07:32,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-13 16:07:32,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:08:23,782 WARN L233 SmtUtils]: Spent 8.69s on a formula simplification. DAG size of input: 54 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 16:08:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 366 proven. 76 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2022-07-13 16:08:23,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:08:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 271 proven. 34 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2022-07-13 16:08:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:08:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988232605] [2022-07-13 16:08:30,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:08:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462426956] [2022-07-13 16:08:30,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462426956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:08:30,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:08:30,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-07-13 16:08:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593290682] [2022-07-13 16:08:30,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:08:30,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 16:08:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:08:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 16:08:30,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=236, Unknown=3, NotChecked=0, Total=306 [2022-07-13 16:08:30,645 INFO L87 Difference]: Start difference. First operand 312 states and 326 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-13 16:08:34,391 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-07-13 16:08:36,586 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-07-13 16:08:39,272 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-07-13 16:08:41,281 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-07-13 16:08:46,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 16:08:48,626 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-07-13 16:08:50,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 16:08:56,068 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 69 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 16:08:58,612 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-07-13 16:09:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:09:00,780 INFO L93 Difference]: Finished difference Result 343 states and 350 transitions. [2022-07-13 16:09:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 16:09:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) Word has length 156 [2022-07-13 16:09:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:09:00,791 INFO L225 Difference]: With dead ends: 343 [2022-07-13 16:09:00,791 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 16:09:00,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=140, Invalid=456, Unknown=4, NotChecked=0, Total=600 [2022-07-13 16:09:00,792 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-07-13 16:09:00,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 210 Invalid, 8 Unknown, 20 Unchecked, 20.9s Time] [2022-07-13 16:09:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 16:09:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-07-13 16:09:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 187 states have (on average 1.0053475935828877) internal successors, (188), 187 states have internal predecessors, (188), 52 states have call successors, (52), 51 states have call predecessors, (52), 50 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-07-13 16:09:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2022-07-13 16:09:00,841 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 156 [2022-07-13 16:09:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:09:00,841 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2022-07-13 16:09:00,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-13 16:09:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2022-07-13 16:09:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-13 16:09:00,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:09:00,848 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:09:00,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-13 16:09:01,053 WARN L477 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-07-13 16:09:01,054 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:09:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:09:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1951591730, now seen corresponding path program 3 times [2022-07-13 16:09:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:09:01,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207603308] [2022-07-13 16:09:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:09:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:09:01,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:09:01,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876076763] [2022-07-13 16:09:01,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:09:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:09:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:09:01,070 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-07-13 16:09:01,070 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-07-13 16:09:01,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-07-13 16:09:01,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:09:01,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 16:09:01,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:09:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-07-13 16:09:02,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:09:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-07-13 16:09:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:09:02,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207603308] [2022-07-13 16:09:02,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:09:02,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876076763] [2022-07-13 16:09:02,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876076763] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:09:02,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:09:02,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-13 16:09:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829109490] [2022-07-13 16:09:02,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:09:02,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 16:09:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:09:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 16:09:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-07-13 16:09:02,280 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-07-13 16:09:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:09:02,858 INFO L93 Difference]: Finished difference Result 636 states and 648 transitions. [2022-07-13 16:09:02,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 16:09:02,858 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) Word has length 293 [2022-07-13 16:09:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:09:02,862 INFO L225 Difference]: With dead ends: 636 [2022-07-13 16:09:02,862 INFO L226 Difference]: Without dead ends: 626 [2022-07-13 16:09:02,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 16:09:02,863 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 262 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 16:09:02,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 514 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 16:09:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-07-13 16:09:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-07-13 16:09:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 403 states have (on average 1.0024813895781637) internal successors, (404), 403 states have internal predecessors, (404), 112 states have call successors, (112), 111 states have call predecessors, (112), 110 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-13 16:09:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 627 transitions. [2022-07-13 16:09:02,919 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 627 transitions. Word has length 293 [2022-07-13 16:09:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:09:02,920 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 627 transitions. [2022-07-13 16:09:02,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-07-13 16:09:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 627 transitions. [2022-07-13 16:09:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2022-07-13 16:09:02,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:09:02,929 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:09:02,934 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-07-13 16:09:03,134 WARN L477 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-07-13 16:09:03,135 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:09:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:09:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1604221590, now seen corresponding path program 4 times [2022-07-13 16:09:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:09:03,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697816540] [2022-07-13 16:09:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:09:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:09:03,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:09:03,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711676674] [2022-07-13 16:09:03,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 16:09:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:09:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:09:03,153 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-07-13 16:09:03,179 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-07-13 16:09:03,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 16:09:03,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:09:03,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-13 16:09:03,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:09:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-07-13 16:09:04,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:09:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-07-13 16:09:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:09:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697816540] [2022-07-13 16:09:04,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:09:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711676674] [2022-07-13 16:09:04,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711676674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:09:04,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:09:04,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-07-13 16:09:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638848291] [2022-07-13 16:09:04,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:09:04,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 16:09:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:09:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 16:09:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 16:09:04,968 INFO L87 Difference]: Start difference. First operand 626 states and 627 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-07-13 16:09:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:09:06,980 INFO L93 Difference]: Finished difference Result 1308 states and 1332 transitions. [2022-07-13 16:09:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-13 16:09:06,981 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) Word has length 629 [2022-07-13 16:09:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:09:06,985 INFO L225 Difference]: With dead ends: 1308 [2022-07-13 16:09:06,985 INFO L226 Difference]: Without dead ends: 1298 [2022-07-13 16:09:06,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-07-13 16:09:06,988 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 778 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 1096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1096 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:09:06,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 703 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1096 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 16:09:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-07-13 16:09:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-07-13 16:09:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 835 states have (on average 1.0011976047904192) internal successors, (836), 835 states have internal predecessors, (836), 232 states have call successors, (232), 231 states have call predecessors, (232), 230 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2022-07-13 16:09:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1299 transitions. [2022-07-13 16:09:07,091 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1299 transitions. Word has length 629 [2022-07-13 16:09:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:09:07,091 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 1299 transitions. [2022-07-13 16:09:07,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-07-13 16:09:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1299 transitions. [2022-07-13 16:09:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2022-07-13 16:09:07,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:09:07,105 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:09:07,111 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-07-13 16:09:07,311 WARN L477 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-07-13 16:09:07,312 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:09:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:09:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1590306266, now seen corresponding path program 5 times [2022-07-13 16:09:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:09:07,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283816331] [2022-07-13 16:09:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:09:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:09:07,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:09:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889051309] [2022-07-13 16:09:07,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 16:09:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:09:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:09:07,337 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-07-13 16:09:07,339 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-07-13 16:09:26,188 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-07-13 16:09:26,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:09:26,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 2774 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-13 16:09:26,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:09:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-07-13 16:09:28,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:09:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-07-13 16:09:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:09:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283816331] [2022-07-13 16:09:29,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:09:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889051309] [2022-07-13 16:09:29,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889051309] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:09:29,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:09:29,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-07-13 16:09:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530221238] [2022-07-13 16:09:29,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:09:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-13 16:09:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:09:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-13 16:09:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 16:09:29,118 INFO L87 Difference]: Start difference. First operand 1298 states and 1299 transitions. Second operand has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) [2022-07-13 16:09:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:09:30,944 INFO L93 Difference]: Finished difference Result 1420 states and 1424 transitions. [2022-07-13 16:09:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-13 16:09:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) Word has length 1301 [2022-07-13 16:09:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:09:30,950 INFO L225 Difference]: With dead ends: 1420 [2022-07-13 16:09:30,950 INFO L226 Difference]: Without dead ends: 1410 [2022-07-13 16:09:30,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2649 GetRequests, 2547 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-07-13 16:09:30,955 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 307 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 16:09:30,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1079 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 16:09:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-07-13 16:09:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-07-13 16:09:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 907 states have (on average 1.0011025358324146) internal successors, (908), 907 states have internal predecessors, (908), 252 states have call successors, (252), 251 states have call predecessors, (252), 250 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) [2022-07-13 16:09:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1411 transitions. [2022-07-13 16:09:31,058 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1411 transitions. Word has length 1301 [2022-07-13 16:09:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:09:31,060 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 1411 transitions. [2022-07-13 16:09:31,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) [2022-07-13 16:09:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1411 transitions. [2022-07-13 16:09:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1414 [2022-07-13 16:09:31,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:09:31,075 INFO L195 NwaCegarLoop]: trace histogram [252, 251, 251, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:09:31,089 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-07-13 16:09:31,289 WARN L477 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-07-13 16:09:31,289 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:09:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:09:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2117698370, now seen corresponding path program 6 times [2022-07-13 16:09:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:09:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787815614] [2022-07-13 16:09:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:09:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:09:31,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:09:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631651211] [2022-07-13 16:09:31,313 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 16:09:31,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:09:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:09:31,314 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-07-13 16:09:31,316 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-07-13 16:09:44,264 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 175 check-sat command(s) [2022-07-13 16:09:44,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 16:09:44,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:09:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:09:45,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 16:09:45,174 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:09:45,175 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:09:45,195 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-07-13 16:09:45,392 WARN L477 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-07-13 16:09:45,395 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-07-13 16:09:45,399 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:09:45,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:09:45 BoogieIcfgContainer [2022-07-13 16:09:45,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:09:45,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:09:45,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:09:45,581 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:09:45,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:07:12" (3/4) ... [2022-07-13 16:09:45,583 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 16:09:45,771 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 16:09:45,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:09:45,772 INFO L158 Benchmark]: Toolchain (without parser) took 154089.90ms. Allocated memory was 107.0MB in the beginning and 211.8MB in the end (delta: 104.9MB). Free memory was 77.7MB in the beginning and 162.6MB in the end (delta: -84.8MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2022-07-13 16:09:45,772 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:09:45,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.21ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 82.1MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 16:09:45,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.21ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:09:45,780 INFO L158 Benchmark]: Boogie Preprocessor took 25.64ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 79.7MB in the end (delta: 712.6kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 16:09:45,780 INFO L158 Benchmark]: RCFGBuilder took 227.80ms. Allocated memory is still 107.0MB. Free memory was 79.3MB in the beginning and 69.6MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 16:09:45,782 INFO L158 Benchmark]: TraceAbstraction took 153405.91ms. Allocated memory was 107.0MB in the beginning and 211.8MB in the end (delta: 104.9MB). Free memory was 68.9MB in the beginning and 91.3MB in the end (delta: -22.5MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2022-07-13 16:09:45,782 INFO L158 Benchmark]: Witness Printer took 190.84ms. Allocated memory is still 211.8MB. Free memory was 91.3MB in the beginning and 162.6MB in the end (delta: -71.2MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-07-13 16:09:45,787 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.15ms. Allocated memory is still 107.0MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.21ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 82.1MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.21ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.64ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 79.7MB in the end (delta: 712.6kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 227.80ms. Allocated memory is still 107.0MB. Free memory was 79.3MB in the beginning and 69.6MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 153405.91ms. Allocated memory was 107.0MB in the beginning and 211.8MB in the end (delta: 104.9MB). Free memory was 68.9MB in the beginning and 91.3MB in the end (delta: -22.5MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * Witness Printer took 190.84ms. Allocated memory is still 211.8MB. Free memory was 91.3MB in the beginning and 162.6MB in the end (delta: -71.2MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * 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 [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 [a=50, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=50, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=50, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=50, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=50, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=50, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=50, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=50, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=50, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=50, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=50, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=50, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=50, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=50, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=50, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=50, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=50, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=50, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=50, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=50, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=50, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=50, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [a=50, counter=22, counter++=21, n=21, x=9261, y=1387, z=132] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [a=50, counter=23, counter++=22, n=22, x=10648, y=1519, z=138] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [a=50, counter=24, counter++=23, n=23, x=12167, y=1657, z=144] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [a=50, counter=25, counter++=24, n=24, x=13824, y=1801, z=150] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [a=50, counter=26, counter++=25, n=25, x=15625, y=1951, z=156] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [a=50, counter=27, counter++=26, n=26, x=17576, y=2107, z=162] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [a=50, counter=28, counter++=27, n=27, x=19683, y=2269, z=168] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [a=50, counter=29, counter++=28, n=28, x=21952, y=2437, z=174] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [a=50, counter=30, counter++=29, n=29, x=24389, y=2611, z=180] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [a=50, counter=31, counter++=30, n=30, x=27000, y=2791, z=186] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [a=50, counter=32, counter++=31, n=31, x=29791, y=2977, z=192] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [a=50, counter=33, counter++=32, n=32, x=32768, y=3169, z=198] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [a=50, counter=34, counter++=33, n=33, x=35937, y=3367, z=204] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [a=50, counter=35, counter++=34, n=34, x=39304, y=3571, z=210] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [a=50, counter=36, counter++=35, n=35, x=42875, y=3781, z=216] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [a=50, counter=37, counter++=36, n=36, x=46656, y=3997, z=222] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [a=50, counter=38, counter++=37, n=37, x=50653, y=4219, z=228] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [a=50, counter=39, counter++=38, n=38, x=54872, y=4447, z=234] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [a=50, counter=40, counter++=39, n=39, x=59319, y=4681, z=240] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [a=50, counter=41, counter++=40, n=40, x=64000, y=4921, z=246] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [a=50, counter=42, counter++=41, n=41, x=68921, y=5167, z=252] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [a=50, counter=43, counter++=42, n=42, x=74088, y=5419, z=258] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [a=50, counter=44, counter++=43, n=43, x=79507, y=5677, z=264] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [a=50, counter=45, counter++=44, n=44, x=85184, y=5941, z=270] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [a=50, counter=46, counter++=45, n=45, x=91125, y=6211, z=276] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [a=50, counter=47, counter++=46, n=46, x=97336, y=6487, z=282] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [a=50, counter=48, counter++=47, n=47, x=103823, y=6769, z=288] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [a=50, counter=49, counter++=48, n=48, x=110592, y=7057, z=294] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [a=50, counter=50, counter++=49, n=49, x=117649, y=7351, z=300] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, 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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, 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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, 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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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 [a=50, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [a=50, counter=51, counter++=50, n=50, x=125000, y=7651, z=306] [L33] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=50, counter=51, n=50, x=125000, y=7651, z=306] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=51] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 153.2s, OverallIterations: 22, TraceHistogramMax: 252, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 41.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 29.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1687 mSDsluCounter, 4563 SdHoareTripleChecker+Invalid, 28.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 3201 mSDsCounter, 2288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5460 IncrementalHoareTripleChecker+Invalid, 7776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2288 mSolverCounterUnsat, 1362 mSDtfsCounter, 5460 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6513 GetRequests, 6083 SyntacticMatches, 16 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1410occurred in iteration=21, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 78 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 35.9s SatisfiabilityAnalysisTime, 68.9s InterpolantComputationTime, 4760 NumberOfCodeBlocks, 4502 NumberOfCodeBlocksAsserted, 399 NumberOfCheckSat, 6195 ConstructedInterpolants, 1 QuantifiedInterpolants, 18038 SizeOfPredicates, 123 NumberOfNonLiveVariables, 7008 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 151579/305050 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-07-13 16:09:45,841 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE