/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:56:14,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:56:14,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:56:14,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:56:14,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:56:14,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:56:14,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:56:14,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:56:14,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:56:14,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:56:14,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:56:14,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:56:14,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:56:14,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:56:14,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:56:14,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:56:14,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:56:14,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:56:14,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:56:14,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:56:14,724 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:56:14,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:56:14,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:56:14,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:56:14,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:56:14,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:56:14,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:56:14,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:56:14,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:56:14,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:56:14,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:56:14,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:56:14,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:56:14,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:56:14,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:56:14,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:56:14,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:56:14,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:56:14,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:56:14,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:56:14,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:56:14,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:56:14,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:56:14,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:56:14,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:56:14,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:56:14,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:56:14,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:56:14,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:56:14,777 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:56:14,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:56:14,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:56:14,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:56:14,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:56:14,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:56:14,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:56:14,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:56:14,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:56:14,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:56:14,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:56:14,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:56:14,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:56:14,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:56:14,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:56:14,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:56:14,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:56:14,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:56:14,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:56:14,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:56:14,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:56:14,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:56:14,782 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:56:14,783 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 23:56:15,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:56:15,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:56:15,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:56:15,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:56:15,079 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:56:15,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-04-07 23:56:15,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0d6d58d/871f7387765f4cd796823f081023835e/FLAG39973f19d [2022-04-07 23:56:15,520 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:56:15,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-04-07 23:56:15,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0d6d58d/871f7387765f4cd796823f081023835e/FLAG39973f19d [2022-04-07 23:56:15,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0d6d58d/871f7387765f4cd796823f081023835e [2022-04-07 23:56:15,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:56:15,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:56:15,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:56:15,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:56:15,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:56:15,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:56:15" (1/1) ... [2022-04-07 23:56:15,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b313cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:15, skipping insertion in model container [2022-04-07 23:56:15,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:56:15" (1/1) ... [2022-04-07 23:56:15,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:56:15,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:56:16,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c[588,601] [2022-04-07 23:56:16,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:56:16,187 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:56:16,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c[588,601] [2022-04-07 23:56:16,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:56:16,232 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:56:16,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16 WrapperNode [2022-04-07 23:56:16,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:56:16,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:56:16,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:56:16,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:56:16,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:56:16,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:56:16,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:56:16,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:56:16,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:56:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:56:16,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 23:56:16,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 23:56:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:56:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:56:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:56:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:56:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:56:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:56:16,361 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:56:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:56:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:56:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:56:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 23:56:16,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:56:16,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:56:16,427 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:56:16,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:56:16,598 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:56:16,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:56:16,605 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:56:16,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:56:16 BoogieIcfgContainer [2022-04-07 23:56:16,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:56:16,608 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:56:16,608 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:56:16,620 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:56:16,622 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:56:16" (1/1) ... [2022-04-07 23:56:16,624 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:56:16,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:56:16 BasicIcfg [2022-04-07 23:56:16,668 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:56:16,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:56:16,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:56:16,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:56:16,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:56:15" (1/4) ... [2022-04-07 23:56:16,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8001826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:56:16, skipping insertion in model container [2022-04-07 23:56:16,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:56:16" (2/4) ... [2022-04-07 23:56:16,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8001826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:56:16, skipping insertion in model container [2022-04-07 23:56:16,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:56:16" (3/4) ... [2022-04-07 23:56:16,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8001826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:56:16, skipping insertion in model container [2022-04-07 23:56:16,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:56:16" (4/4) ... [2022-04-07 23:56:16,675 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.cqvasr [2022-04-07 23:56:16,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:56:16,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:56:16,717 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:56:16,722 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 23:56:16,723 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:56:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 23:56:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 23:56:16,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:16,744 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:16,745 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-07 23:56:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:16,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170940668] [2022-04-07 23:56:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:56:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:16,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 23:56:16,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 23:56:16,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 23:56:16,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:56:16,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 23:56:16,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 23:56:16,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 23:56:16,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 23:56:16,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {34#true} is VALID [2022-04-07 23:56:16,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [90] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 23:56:16,909 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {35#false} is VALID [2022-04-07 23:56:16,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-07 23:56:16,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 23:56:16,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 23:56:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:56:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:56:16,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170940668] [2022-04-07 23:56:16,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170940668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:56:16,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:56:16,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:56:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489458833] [2022-04-07 23:56:16,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:56:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 23:56:16,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:56:16,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:16,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:16,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:56:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:56:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:56:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:56:16,993 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:17,228 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-07 23:56:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:56:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 23:56:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:56:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 23:56:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 23:56:17,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-07 23:56:17,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:17,396 INFO L225 Difference]: With dead ends: 57 [2022-04-07 23:56:17,396 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 23:56:17,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:56:17,408 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:56:17,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:56:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 23:56:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 23:56:17,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:56:17,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,451 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,452 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:17,462 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 23:56:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 23:56:17,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:17,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:17,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 23:56:17,466 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 23:56:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:17,475 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 23:56:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 23:56:17,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:17,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:17,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:56:17,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:56:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-07 23:56:17,485 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-07 23:56:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:56:17,485 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-07 23:56:17,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-07 23:56:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:56:17,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:17,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:17,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:56:17,486 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:17,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-07 23:56:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:17,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142661034] [2022-04-07 23:56:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:56:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:17,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:56:17,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {232#(= ~counter~0 0)} is VALID [2022-04-07 23:56:17,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {233#(= |main_#t~post5| 0)} is VALID [2022-04-07 23:56:17,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 1)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {228#false} is VALID [2022-04-07 23:56:17,586 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {228#false} is VALID [2022-04-07 23:56:17,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {228#false} is VALID [2022-04-07 23:56:17,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {228#false} is VALID [2022-04-07 23:56:17,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#false} is VALID [2022-04-07 23:56:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:56:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:56:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142661034] [2022-04-07 23:56:17,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142661034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:56:17,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:56:17,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:56:17,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678285787] [2022-04-07 23:56:17,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:56:17,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:56:17,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:56:17,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:17,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:56:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:56:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:56:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:56:17,604 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:17,889 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 23:56:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:56:17,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:56:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:56:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 23:56:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 23:56:17,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-07 23:56:17,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:17,963 INFO L225 Difference]: With dead ends: 40 [2022-04-07 23:56:17,963 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 23:56:17,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:56:17,971 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:56:17,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:56:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 23:56:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 23:56:17,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:56:17,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,983 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,983 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:17,986 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 23:56:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 23:56:17,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:17,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:17,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 23:56:17,988 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 23:56:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:17,990 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 23:56:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 23:56:17,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:17,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:17,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:56:17,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:56:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-07 23:56:17,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-07 23:56:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:56:17,995 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-07 23:56:17,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 23:56:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:56:17,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:17,996 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:17,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:56:17,996 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-07 23:56:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:17,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095070200] [2022-04-07 23:56:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:56:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:18,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {406#true} is VALID [2022-04-07 23:56:18,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-07 23:56:18,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-07 23:56:18,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:56:18,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {406#true} is VALID [2022-04-07 23:56:18,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-07 23:56:18,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-07 23:56:18,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-07 23:56:18,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 23:56:18,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 23:56:18,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 23:56:18,129 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:56:18,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:56:18,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {407#false} is VALID [2022-04-07 23:56:18,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#false} is VALID [2022-04-07 23:56:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:56:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:56:18,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095070200] [2022-04-07 23:56:18,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095070200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:56:18,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:56:18,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 23:56:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424115924] [2022-04-07 23:56:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:56:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:56:18,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:56:18,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:18,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:18,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:56:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:56:18,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:56:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:56:18,145 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:18,552 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-07 23:56:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 23:56:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:56:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:56:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 23:56:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 23:56:18,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 23:56:18,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:18,605 INFO L225 Difference]: With dead ends: 34 [2022-04-07 23:56:18,605 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 23:56:18,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 23:56:18,606 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:56:18,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:56:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 23:56:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 23:56:18,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:56:18,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:18,613 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:18,614 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:18,616 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 23:56:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 23:56:18,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:18,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:18,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 23:56:18,618 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 23:56:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:18,620 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 23:56:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 23:56:18,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:18,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:18,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:56:18,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:56:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 23:56:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 23:56:18,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 23:56:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:56:18,627 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 23:56:18,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:56:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 23:56:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 23:56:18,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:18,628 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:18,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 23:56:18,629 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-07 23:56:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:18,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502910873] [2022-04-07 23:56:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:18,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:56:18,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367336409] [2022-04-07 23:56:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:18,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:56:18,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:56:18,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 23:56:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:18,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 23:56:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:18,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:56:18,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 23:56:18,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {593#true} is VALID [2022-04-07 23:56:18,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 23:56:18,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 23:56:18,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 23:56:18,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 23:56:18,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 23:56:18,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 23:56:18,956 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {593#true} is VALID [2022-04-07 23:56:18,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {593#true} is VALID [2022-04-07 23:56:18,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 23:56:18,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 23:56:18,958 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 23:56:18,958 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:56:18,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:56:18,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-07 23:56:18,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-07 23:56:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:56:18,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:56:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:56:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502910873] [2022-04-07 23:56:18,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:56:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367336409] [2022-04-07 23:56:18,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367336409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:56:18,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:56:18,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:56:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533789358] [2022-04-07 23:56:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:56:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 23:56:18,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:56:18,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:56:18,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:18,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:56:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:56:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:56:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:56:18,982 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:56:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:19,270 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-07 23:56:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:56:19,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 23:56:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:56:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:56:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 23:56:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:56:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 23:56:19,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 23:56:19,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:19,351 INFO L225 Difference]: With dead ends: 50 [2022-04-07 23:56:19,351 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 23:56:19,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:56:19,359 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:56:19,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:56:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 23:56:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-07 23:56:19,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:56:19,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 23:56:19,381 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 23:56:19,382 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 23:56:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:19,390 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 23:56:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 23:56:19,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:19,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:19,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 23:56:19,393 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 23:56:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:19,397 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 23:56:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 23:56:19,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:19,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:19,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:56:19,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:56:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 23:56:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 23:56:19,400 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-07 23:56:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:56:19,401 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 23:56:19,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:56:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 23:56:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 23:56:19,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:19,401 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:19,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:56:19,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:19,602 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-07 23:56:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:19,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443076120] [2022-04-07 23:56:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:19,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:56:19,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575106858] [2022-04-07 23:56:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:19,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:19,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:56:19,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:56:19,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 23:56:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:19,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 23:56:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:19,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:56:19,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {887#true} is VALID [2022-04-07 23:56:19,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 23:56:19,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 23:56:19,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 23:56:19,825 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {887#true} is VALID [2022-04-07 23:56:19,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {887#true} is VALID [2022-04-07 23:56:19,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,826 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 23:56:19,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {887#true} is VALID [2022-04-07 23:56:19,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {887#true} is VALID [2022-04-07 23:56:19,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-07 23:56:19,828 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 23:56:19,829 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:56:19,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:56:19,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {888#false} is VALID [2022-04-07 23:56:19,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {888#false} is VALID [2022-04-07 23:56:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:56:19,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:56:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:56:19,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443076120] [2022-04-07 23:56:19,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:56:19,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575106858] [2022-04-07 23:56:19,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575106858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:56:19,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:56:19,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:56:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224697482] [2022-04-07 23:56:19,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:56:19,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 23:56:19,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:56:19,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:56:19,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:19,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:56:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:56:19,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:56:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:56:19,851 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:56:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:20,162 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-07 23:56:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:56:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 23:56:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:56:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:56:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 23:56:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:56:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 23:56:20,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 23:56:20,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:20,230 INFO L225 Difference]: With dead ends: 54 [2022-04-07 23:56:20,230 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 23:56:20,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:56:20,231 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:56:20,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:56:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 23:56:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-07 23:56:20,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:56:20,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 23:56:20,244 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 23:56:20,244 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 23:56:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:20,248 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 23:56:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 23:56:20,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:20,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:20,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 23:56:20,249 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 23:56:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:20,253 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 23:56:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 23:56:20,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:20,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:20,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:56:20,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:56:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 23:56:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-07 23:56:20,258 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-07 23:56:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:56:20,258 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-07 23:56:20,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 23:56:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-07 23:56:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 23:56:20,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:20,259 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:20,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 23:56:20,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:20,486 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-07 23:56:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:20,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974374705] [2022-04-07 23:56:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:20,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:56:20,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316774632] [2022-04-07 23:56:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:20,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:56:20,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:56:20,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 23:56:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:20,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 23:56:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:56:20,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:56:20,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1225#true} is VALID [2022-04-07 23:56:20,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 23:56:20,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 23:56:20,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 23:56:20,708 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1225#true} is VALID [2022-04-07 23:56:20,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#true} is VALID [2022-04-07 23:56:20,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,709 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 23:56:20,710 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1225#true} is VALID [2022-04-07 23:56:20,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#true} is VALID [2022-04-07 23:56:20,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,712 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 23:56:20,712 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1225#true} is VALID [2022-04-07 23:56:20,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#true} is VALID [2022-04-07 23:56:20,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-07 23:56:20,716 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 23:56:20,718 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:56:20,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:56:20,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1226#false} is VALID [2022-04-07 23:56:20,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1226#false} is VALID [2022-04-07 23:56:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 23:56:20,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:56:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:56:20,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974374705] [2022-04-07 23:56:20,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:56:20,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316774632] [2022-04-07 23:56:20,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316774632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:56:20,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:56:20,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:56:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57945603] [2022-04-07 23:56:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:56:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 23:56:20,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:56:20,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:56:20,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:20,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:56:20,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:56:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:56:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:56:20,744 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:56:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:21,098 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-07 23:56:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 23:56:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 23:56:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:56:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:56:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 23:56:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:56:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 23:56:21,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 23:56:21,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:56:21,171 INFO L225 Difference]: With dead ends: 62 [2022-04-07 23:56:21,171 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 23:56:21,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:56:21,172 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:56:21,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:56:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 23:56:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 23:56:21,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:56:21,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 23:56:21,181 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 23:56:21,182 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 23:56:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:21,184 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 23:56:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 23:56:21,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:21,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:21,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 23:56:21,185 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 23:56:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:56:21,187 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 23:56:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 23:56:21,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:56:21,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:56:21,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:56:21,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:56:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 23:56:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 23:56:21,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-07 23:56:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:56:21,191 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 23:56:21,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 23:56:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 23:56:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 23:56:21,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:56:21,192 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:21,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 23:56:21,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:21,408 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:56:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:56:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-07 23:56:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:56:21,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636979594] [2022-04-07 23:56:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:56:21,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:56:21,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560317804] [2022-04-07 23:56:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:56:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:56:21,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:56:21,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 23:56:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 23:56:21,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 23:56:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 23:56:21,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 23:56:21,595 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 23:56:21,596 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:56:21,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 23:56:21,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:56:21,818 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:56:21,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 23:56:21,847 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,848 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:56:21,849 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:56:21,849 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:56:21,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:56:21 BasicIcfg [2022-04-07 23:56:21,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:56:21,851 INFO L158 Benchmark]: Toolchain (without parser) took 5908.24ms. Allocated memory was 195.0MB in the beginning and 239.1MB in the end (delta: 44.0MB). Free memory was 144.7MB in the beginning and 211.9MB in the end (delta: -67.3MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-04-07 23:56:21,851 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 195.0MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:56:21,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.48ms. Allocated memory is still 195.0MB. Free memory was 144.5MB in the beginning and 172.0MB in the end (delta: -27.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 23:56:21,851 INFO L158 Benchmark]: Boogie Preprocessor took 36.23ms. Allocated memory is still 195.0MB. Free memory was 172.0MB in the beginning and 170.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:56:21,852 INFO L158 Benchmark]: RCFGBuilder took 337.04ms. Allocated memory is still 195.0MB. Free memory was 170.2MB in the beginning and 159.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 23:56:21,852 INFO L158 Benchmark]: IcfgTransformer took 60.09ms. Allocated memory is still 195.0MB. Free memory was 159.0MB in the beginning and 157.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 23:56:21,852 INFO L158 Benchmark]: TraceAbstraction took 5180.40ms. Allocated memory was 195.0MB in the beginning and 239.1MB in the end (delta: 44.0MB). Free memory was 156.9MB in the beginning and 211.9MB in the end (delta: -55.0MB). Peak memory consumption was 112.1MB. Max. memory is 8.0GB. [2022-04-07 23:56:21,853 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 195.0MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.48ms. Allocated memory is still 195.0MB. Free memory was 144.5MB in the beginning and 172.0MB in the end (delta: -27.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.23ms. Allocated memory is still 195.0MB. Free memory was 172.0MB in the beginning and 170.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 337.04ms. Allocated memory is still 195.0MB. Free memory was 170.2MB in the beginning and 159.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 60.09ms. Allocated memory is still 195.0MB. Free memory was 159.0MB in the beginning and 157.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5180.40ms. Allocated memory was 195.0MB in the beginning and 239.1MB in the end (delta: 44.0MB). Free memory was 156.9MB in the beginning and 211.9MB in the end (delta: -55.0MB). Peak memory consumption was 112.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=1, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<1 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=1, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND FALSE !(counter++<1) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=1, counter=2, n=1, x=1, y=7, z=12] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=2] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 578 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 248 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 3 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 23:56:21,866 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...