/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/dijkstra-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:08:28,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:08:28,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:08:28,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:08:28,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:08:28,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:08:28,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:08:28,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:08:28,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:08:28,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:08:28,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:08:28,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:08:28,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:08:28,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:08:28,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:08:28,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:08:28,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:08:28,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:08:28,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:08:28,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:08:28,666 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:08:28,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:08:28,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:08:28,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:08:28,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:08:28,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:08:28,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:08:28,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:08:28,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:08:28,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:08:28,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:08:28,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:08:28,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:08:28,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:08:28,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:08:28,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:08:28,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:08:28,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:08:28,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:08:28,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:08:28,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:08:28,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:08:28,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:08:28,713 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:08:28,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:08:28,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:08:28,715 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:08:28,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:08:28,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:08:28,716 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:08:28,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:08:28,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:08:28,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:08:28,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:08:28,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:08:28,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:08:28,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:08:28,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:08:28,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:08:28,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:08:28,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:08:28,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:08:28,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:28,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:08:28,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:08:28,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:08:28,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:08:28,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:08:28,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:08:28,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:08:28,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:08:28,720 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:08:28,720 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-27 23:08:28,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:08:28,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:08:28,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:08:28,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:08:28,957 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:08:28,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-04-27 23:08:29,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764dea2fa/078db9fa68ed402297318418478ae557/FLAG40969034c [2022-04-27 23:08:29,394 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:08:29,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-04-27 23:08:29,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764dea2fa/078db9fa68ed402297318418478ae557/FLAG40969034c [2022-04-27 23:08:29,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764dea2fa/078db9fa68ed402297318418478ae557 [2022-04-27 23:08:29,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:08:29,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:08:29,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:29,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:08:29,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:08:29,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c19cb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29, skipping insertion in model container [2022-04-27 23:08:29,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:08:29,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:08:29,584 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/dijkstra-u_unwindbound2.c[525,538] [2022-04-27 23:08:29,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:29,625 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:08:29,634 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/dijkstra-u_unwindbound2.c[525,538] [2022-04-27 23:08:29,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:29,661 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:08:29,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29 WrapperNode [2022-04-27 23:08:29,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:29,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:08:29,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:08:29,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:08:29,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:08:29,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:08:29,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:08:29,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:08:29,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (1/1) ... [2022-04-27 23:08:29,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:29,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:08:29,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:08:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:08:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:08:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:08:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:08:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:08:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:08:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:08:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:08:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:08:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:08:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:08:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:08:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:08:29,826 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:08:29,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:08:30,052 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:08:30,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:08:30,058 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:08:30,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:30 BoogieIcfgContainer [2022-04-27 23:08:30,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:08:30,061 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:08:30,061 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:08:30,062 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:08:30,064 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:30" (1/1) ... [2022-04-27 23:08:30,066 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:08:30,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:30 BasicIcfg [2022-04-27 23:08:30,115 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:08:30,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:08:30,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:08:30,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:08:30,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:08:29" (1/4) ... [2022-04-27 23:08:30,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:29" (2/4) ... [2022-04-27 23:08:30,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:30" (3/4) ... [2022-04-27 23:08:30,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:08:30, skipping insertion in model container [2022-04-27 23:08:30,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:30" (4/4) ... [2022-04-27 23:08:30,122 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.cqvasr [2022-04-27 23:08:30,133 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:08:30,133 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:08:30,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:08:30,180 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cd3033, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a723c65 [2022-04-27 23:08:30,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:08:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 23:08:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 23:08:30,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:30,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:30,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash -460462115, now seen corresponding path program 1 times [2022-04-27 23:08:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:30,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008087563] [2022-04-27 23:08:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:30,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {42#true} is VALID [2022-04-27 23:08:30,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:30,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:30,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 23:08:30,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:30,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {42#true} is VALID [2022-04-27 23:08:30,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:30,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#true} is VALID [2022-04-27 23:08:30,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:30,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:30,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 23:08:30,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:30,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} [114] L30-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} [118] L52-2-->L38-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,443 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:30,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-27 23:08:30,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:30,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008087563] [2022-04-27 23:08:30,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008087563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:30,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:30,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:08:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121761513] [2022-04-27 23:08:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:08:30,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:30,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:30,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:08:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:08:30,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:30,518 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:31,570 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 23:08:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:08:31,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:08:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:08:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:08:31,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 23:08:31,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:31,734 INFO L225 Difference]: With dead ends: 70 [2022-04-27 23:08:31,735 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 23:08:31,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-27 23:08:31,742 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:31,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 23:08:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 23:08:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 23:08:31,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:31,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:31,780 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:31,780 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:31,800 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 23:08:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 23:08:31,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:31,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:31,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 23:08:31,802 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 23:08:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:31,806 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 23:08:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 23:08:31,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:31,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:31,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:31,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 23:08:31,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 23:08:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:31,819 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 23:08:31,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 23:08:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 23:08:31,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:31,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:31,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:08:31,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash -889932734, now seen corresponding path program 1 times [2022-04-27 23:08:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:31,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744175320] [2022-04-27 23:08:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:31,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:31,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509594441] [2022-04-27 23:08:31,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:31,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:31,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:08:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:31,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:08:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:31,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:32,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:32,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:32,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} [115] L30-3-->L30-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] {316#(<= |main_#t~post5| 0)} is VALID [2022-04-27 23:08:32,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {275#false} is VALID [2022-04-27 23:08:32,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {275#false} is VALID [2022-04-27 23:08:32,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {275#false} is VALID [2022-04-27 23:08:32,138 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {275#false} is VALID [2022-04-27 23:08:32,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {275#false} is VALID [2022-04-27 23:08:32,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:08:32,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:08:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:32,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:32,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744175320] [2022-04-27 23:08:32,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:32,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509594441] [2022-04-27 23:08:32,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509594441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:32,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:32,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:08:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107190913] [2022-04-27 23:08:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:32,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 23:08:32,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:32,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:32,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:32,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 23:08:32,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 23:08:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:08:32,169 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:38,513 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 23:08:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 23:08:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 23:08:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 23:08:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 23:08:38,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 23:08:38,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:38,642 INFO L225 Difference]: With dead ends: 55 [2022-04-27 23:08:38,642 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 23:08:38,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:08:38,645 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:38,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 23:08:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 23:08:38,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:38,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,660 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,660 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:38,666 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 23:08:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:38,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:38,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:38,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 23:08:38,674 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 23:08:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:38,679 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 23:08:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:38,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:38,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:38,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:38,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 23:08:38,690 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 23:08:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:38,690 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 23:08:38,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:08:38,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:38,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:38,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 23:08:38,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:38,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1699853977, now seen corresponding path program 1 times [2022-04-27 23:08:38,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:38,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15337400] [2022-04-27 23:08:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:38,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:38,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931415205] [2022-04-27 23:08:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:38,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:38,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:38,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:38,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:08:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:38,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:08:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:39,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:39,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#true} is VALID [2022-04-27 23:08:39,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:39,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} [115] L30-3-->L30-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] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:39,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:39,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:39,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {598#(<= |main_#t~post6| 1)} is VALID [2022-04-27 23:08:39,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {547#false} is VALID [2022-04-27 23:08:39,183 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {547#false} is VALID [2022-04-27 23:08:39,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {547#false} is VALID [2022-04-27 23:08:39,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-27 23:08:39,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-27 23:08:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:39,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:39,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15337400] [2022-04-27 23:08:39,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:39,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931415205] [2022-04-27 23:08:39,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931415205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:39,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:39,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:08:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888493046] [2022-04-27 23:08:39,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 23:08:39,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:39,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:39,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:08:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:08:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:08:39,202 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:51,528 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 23:08:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:08:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 23:08:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:08:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:08:51,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 23:08:51,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:51,599 INFO L225 Difference]: With dead ends: 49 [2022-04-27 23:08:51,599 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 23:08:51,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:08:51,600 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:51,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 23:08:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 23:08:51,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:51,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:51,609 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:51,609 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:51,611 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 23:08:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 23:08:51,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:51,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:51,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 23:08:51,613 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 23:08:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:51,615 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 23:08:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 23:08:51,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:51,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:51,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:51,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 23:08:51,618 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 23:08:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:51,619 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 23:08:51,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 23:08:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:08:51,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:51,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:51,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:51,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:08:51,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:51,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1700986035, now seen corresponding path program 1 times [2022-04-27 23:08:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738990471] [2022-04-27 23:08:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:52,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {822#true} is VALID [2022-04-27 23:08:52,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:52,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-27 23:08:52,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:52,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:52,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {822#true} is VALID [2022-04-27 23:08:52,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {822#true} is VALID [2022-04-27 23:08:52,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:52,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-27 23:08:52,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:52,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:52,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:52,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [115] L30-3-->L30-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] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:52,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:52,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:52,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:52,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:52,101 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:52,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:08:52,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-27 23:08:52,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-27 23:08:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:52,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738990471] [2022-04-27 23:08:52,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738990471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:52,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:52,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:08:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935484043] [2022-04-27 23:08:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:52,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 23:08:52,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:52,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:52,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:52,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:08:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:08:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:08:52,132 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:56,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:08:59,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:01,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:04,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:06,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:08,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:11,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:16,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:20,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:21,112 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 23:09:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:09:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 23:09:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 23:09:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 23:09:21,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 23:09:21,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:21,356 INFO L225 Difference]: With dead ends: 72 [2022-04-27 23:09:21,356 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 23:09:21,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:09:21,358 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 37 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:21,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 200 Invalid, 9 Unknown, 0 Unchecked, 23.7s Time] [2022-04-27 23:09:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 23:09:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 23:09:21,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:21,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:21,374 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:21,375 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:21,377 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 23:09:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:21,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:21,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:21,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 23:09:21,379 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 23:09:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:21,381 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 23:09:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:21,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:21,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:21,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:21,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 23:09:21,385 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 23:09:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:21,385 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 23:09:21,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:09:21,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:21,386 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:21,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 23:09:21,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1908885951, now seen corresponding path program 1 times [2022-04-27 23:09:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:21,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320966679] [2022-04-27 23:09:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:21,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:21,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599264765] [2022-04-27 23:09:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:21,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:21,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:09:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:21,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:09:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:21,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:21,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:21,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} [115] L30-3-->L30-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] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:21,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:21,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:21,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} [115] L30-3-->L30-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] {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-27 23:09:21,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-27 23:09:21,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:21,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:21,586 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-27 23:09:21,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1138#false} is VALID [2022-04-27 23:09:21,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:21,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:21,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:21,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:21,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:21,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1138#false} is VALID [2022-04-27 23:09:21,723 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-27 23:09:21,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:21,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:21,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-27 23:09:21,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} [115] L30-3-->L30-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] {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-27 23:09:21,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:21,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:21,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} [115] L30-3-->L30-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] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:21,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1145#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:21,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:21,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1137#true} is VALID [2022-04-27 23:09:21,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1137#true} is VALID [2022-04-27 23:09:21,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:21,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:21,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:21,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320966679] [2022-04-27 23:09:21,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:21,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599264765] [2022-04-27 23:09:21,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599264765] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:21,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:21,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 23:09:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400117076] [2022-04-27 23:09:21,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:09:21,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:21,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:21,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:21,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:09:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:21,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:09:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:09:21,763 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:34,485 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2022-04-27 23:09:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:09:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:09:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 23:09:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 23:09:34,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-27 23:09:34,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:34,563 INFO L225 Difference]: With dead ends: 72 [2022-04-27 23:09:34,563 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 23:09:34,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:09:34,565 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:34,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:09:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 23:09:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 23:09:34,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:34,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:34,580 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:34,581 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:34,583 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 23:09:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-27 23:09:34,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:34,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:34,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 53 states. [2022-04-27 23:09:34,584 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 53 states. [2022-04-27 23:09:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:34,587 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 23:09:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-27 23:09:34,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:34,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:34,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:34,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-04-27 23:09:34,590 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2022-04-27 23:09:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:34,590 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-04-27 23:09:34,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:09:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-27 23:09:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:09:34,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:34,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:34,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 23:09:34,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:34,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1731080004, now seen corresponding path program 1 times [2022-04-27 23:09:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598464770] [2022-04-27 23:09:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:34,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961137817] [2022-04-27 23:09:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:34,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:34,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:34,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:09:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:34,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:09:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:34,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:35,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1576#true} is VALID [2022-04-27 23:09:35,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {1576#true} is VALID [2022-04-27 23:09:35,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1576#true} is VALID [2022-04-27 23:09:35,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1576#true} is VALID [2022-04-27 23:09:35,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1576#true} is VALID [2022-04-27 23:09:35,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1576#true} is VALID [2022-04-27 23:09:35,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1576#true} is VALID [2022-04-27 23:09:35,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1576#true} is VALID [2022-04-27 23:09:35,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1576#true} is VALID [2022-04-27 23:09:35,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1576#true} is VALID [2022-04-27 23:09:35,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1576#true} is VALID [2022-04-27 23:09:35,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-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] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-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] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1614#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:09:35,094 INFO L272 TraceCheckUtils]: 20: Hoare triple {1614#(and (= main_~p~0 0) (= main_~h~0 0))} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:09:35,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {1642#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:09:35,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {1646#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1577#false} is VALID [2022-04-27 23:09:35,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {1577#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1577#false} is VALID [2022-04-27 23:09:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 23:09:35,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:09:35,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:35,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598464770] [2022-04-27 23:09:35,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:35,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961137817] [2022-04-27 23:09:35,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961137817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:09:35,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:09:35,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:09:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676041041] [2022-04-27 23:09:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:09:35,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 23:09:35,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:35,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:35,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:35,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:09:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:09:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:09:35,125 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:39,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:41,595 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-04-27 23:09:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:09:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 23:09:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 23:09:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 23:09:41,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-27 23:09:41,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:41,675 INFO L225 Difference]: With dead ends: 75 [2022-04-27 23:09:41,676 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 23:09:41,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-27 23:09:41,677 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:41,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 23:09:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 23:09:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 23:09:41,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:41,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:41,690 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:41,690 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:41,693 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-04-27 23:09:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-27 23:09:41,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:41,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:41,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-27 23:09:41,694 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-27 23:09:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:41,696 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-04-27 23:09:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-27 23:09:41,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:41,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:41,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:41,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2022-04-27 23:09:41,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 24 [2022-04-27 23:09:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:41,699 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2022-04-27 23:09:41,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-27 23:09:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:09:41,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:41,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:41,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:09:41,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:41,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1729947946, now seen corresponding path program 1 times [2022-04-27 23:09:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:41,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059529082] [2022-04-27 23:09:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:42,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:09:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:42,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {1970#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1962#(<= 0 ~counter~0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1962#(<= 0 ~counter~0)} {1957#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:09:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:42,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1957#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1957#true} is VALID [2022-04-27 23:09:42,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1957#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1957#true} is VALID [2022-04-27 23:09:42,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {1957#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1957#true} is VALID [2022-04-27 23:09:42,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1957#true} {1962#(<= 0 ~counter~0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {1957#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1970#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:09:42,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1970#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {1962#(<= 0 ~counter~0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1962#(<= 0 ~counter~0)} {1957#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {1962#(<= 0 ~counter~0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1962#(<= 0 ~counter~0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {1962#(<= 0 ~counter~0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1957#true} is VALID [2022-04-27 23:09:42,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {1957#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1957#true} is VALID [2022-04-27 23:09:42,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1957#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1957#true} is VALID [2022-04-27 23:09:42,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {1957#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1957#true} is VALID [2022-04-27 23:09:42,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1957#true} {1962#(<= 0 ~counter~0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {1962#(<= 0 ~counter~0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1962#(<= 0 ~counter~0)} is VALID [2022-04-27 23:09:42,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1962#(<= 0 ~counter~0)} [115] L30-3-->L30-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] {1967#(<= 1 ~counter~0)} is VALID [2022-04-27 23:09:42,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= 1 ~counter~0)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1967#(<= 1 ~counter~0)} is VALID [2022-04-27 23:09:42,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {1967#(<= 1 ~counter~0)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1967#(<= 1 ~counter~0)} is VALID [2022-04-27 23:09:42,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= 1 ~counter~0)} [115] L30-3-->L30-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] {1968#(<= 2 ~counter~0)} is VALID [2022-04-27 23:09:42,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {1968#(<= 2 ~counter~0)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1968#(<= 2 ~counter~0)} is VALID [2022-04-27 23:09:42,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1968#(<= 2 ~counter~0)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1968#(<= 2 ~counter~0)} is VALID [2022-04-27 23:09:42,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1968#(<= 2 ~counter~0)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1969#(<= 2 |main_#t~post6|)} is VALID [2022-04-27 23:09:42,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {1969#(<= 2 |main_#t~post6|)} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1958#false} is VALID [2022-04-27 23:09:42,036 INFO L272 TraceCheckUtils]: 20: Hoare triple {1958#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1958#false} is VALID [2022-04-27 23:09:42,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {1958#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1958#false} is VALID [2022-04-27 23:09:42,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {1958#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1958#false} is VALID [2022-04-27 23:09:42,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {1958#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1958#false} is VALID [2022-04-27 23:09:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:42,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059529082] [2022-04-27 23:09:42,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059529082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:09:42,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:09:42,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:09:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069327769] [2022-04-27 23:09:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:09:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 23:09:42,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:42,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:09:42,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:42,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:09:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:42,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:09:42,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:09:42,057 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:09:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:42,464 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 23:09:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:09:42,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 23:09:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:09:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-27 23:09:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:09:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-27 23:09:42,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2022-04-27 23:09:42,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:42,523 INFO L225 Difference]: With dead ends: 66 [2022-04-27 23:09:42,523 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 23:09:42,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:09:42,524 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:42,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 23:09:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 23:09:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 23:09:42,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:42,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 23:09:42,538 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 23:09:42,538 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 23:09:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:42,539 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 23:09:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 23:09:42,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:42,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:42,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 23:09:42,540 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 23:09:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:42,541 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 23:09:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 23:09:42,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:42,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:42,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:42,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 23:09:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-27 23:09:42,542 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-27 23:09:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:42,543 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-27 23:09:42,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:09:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 23:09:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 23:09:42,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:42,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:42,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 23:09:42,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1279154140, now seen corresponding path program 1 times [2022-04-27 23:09:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:42,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875518224] [2022-04-27 23:09:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:42,554 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:42,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562029118] [2022-04-27 23:09:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:42,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:42,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:42,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 23:09:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:42,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:09:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:42,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:42,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {2187#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {2187#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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) (= v_~counter~0_5 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_5, #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] {2187#true} is VALID [2022-04-27 23:09:42,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {2187#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2187#true} {2187#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {2187#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {2187#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2187#true} is VALID [2022-04-27 23:09:42,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {2187#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2187#true} is VALID [2022-04-27 23:09:42,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2187#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2187#true} is VALID [2022-04-27 23:09:42,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {2187#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {2187#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2187#true} {2187#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2187#true} is VALID [2022-04-27 23:09:42,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {2187#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-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] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-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] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,798 INFO L272 TraceCheckUtils]: 20: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2187#true} is VALID [2022-04-27 23:09:42,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2187#true} is VALID [2022-04-27 23:09:42,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {2187#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {2187#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#true} is VALID [2022-04-27 23:09:42,799 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2187#true} {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [156] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:09:42,800 INFO L272 TraceCheckUtils]: 25: Hoare triple {2225#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [128] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_22 (* v_main_~p~0_23 v_main_~p~0_23) (* v_main_~n~0_23 4294967295)) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_8|) InVars {main_~n~0=v_main_~n~0_23, main_~p~0=v_main_~p~0_23, main_~r~0=v_main_~r~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {2268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:09:42,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {2268#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:09:42,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {2272#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2188#false} is VALID [2022-04-27 23:09:42,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {2188#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2188#false} is VALID [2022-04-27 23:09:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 23:09:42,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:09:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:42,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875518224] [2022-04-27 23:09:42,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562029118] [2022-04-27 23:09:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562029118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:09:42,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:09:42,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:09:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096650664] [2022-04-27 23:09:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:09:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-04-27 23:09:42,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:42,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-27 23:09:42,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:42,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:09:42,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:09:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:09:42,825 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-27 23:09:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:42,954 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 23:09:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:09:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-04-27 23:09:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-27 23:09:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 23:09:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-27 23:09:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 23:09:42,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-27 23:09:42,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:42,977 INFO L225 Difference]: With dead ends: 32 [2022-04-27 23:09:42,977 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 23:09:42,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-27 23:09:42,978 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:42,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:09:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 23:09:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 23:09:42,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:42,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:42,980 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:42,980 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:42,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 23:09:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:09:42,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:42,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:42,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 23:09:42,980 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 23:09:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:42,981 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 23:09:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:09:42,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:42,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:42,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:42,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 23:09:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 23:09:42,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-27 23:09:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:42,981 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 23:09:42,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-27 23:09:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 23:09:42,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:42,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:09:43,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 23:09:43,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:43,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 23:09:43,485 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 23:09:43,485 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 23:09:43,485 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 23:09:43,486 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 23:09:43,486 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 23:09:43,486 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,486 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,486 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 23:09:43,486 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (and .cse0 .cse1 (<= 1 ~counter~0) .cse2) (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 (<= 0 ~counter~0) .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-27 23:09:43,487 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2022-04-27 23:09:43,487 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-04-27 23:09:43,487 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-27 23:09:43,487 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2022-04-27 23:09:43,487 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-04-27 23:09:43,487 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0))) (or (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (= main_~h~0 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-27 23:09:43,487 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,487 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0))) (or (and .cse0 (= main_~h~0 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 (= main_~n~0 main_~r~0) (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-27 23:09:43,487 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,487 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 61) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 61) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,488 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 23:09:43,488 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 23:09:43,489 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 23:09:43,489 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 23:09:43,491 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:43,492 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:09:43,496 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:09:43,497 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 23:09:43,498 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 23:09:43,499 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 23:09:43,500 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:09:43,500 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 23:09:43,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:09:43 BasicIcfg [2022-04-27 23:09:43,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:09:43,511 INFO L158 Benchmark]: Toolchain (without parser) took 74092.77ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 143.1MB in the beginning and 85.7MB in the end (delta: 57.4MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2022-04-27 23:09:43,511 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:09:43,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.98ms. Allocated memory is still 192.9MB. Free memory was 142.9MB in the beginning and 168.5MB in the end (delta: -25.6MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 23:09:43,512 INFO L158 Benchmark]: Boogie Preprocessor took 39.47ms. Allocated memory is still 192.9MB. Free memory was 168.5MB in the beginning and 167.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:09:43,512 INFO L158 Benchmark]: RCFGBuilder took 357.02ms. Allocated memory is still 192.9MB. Free memory was 167.0MB in the beginning and 152.9MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 23:09:43,512 INFO L158 Benchmark]: IcfgTransformer took 55.02ms. Allocated memory is still 192.9MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:09:43,512 INFO L158 Benchmark]: TraceAbstraction took 73393.04ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 150.2MB in the beginning and 85.7MB in the end (delta: 64.5MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-04-27 23:09:43,514 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.11ms. Allocated memory is still 192.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.98ms. Allocated memory is still 192.9MB. Free memory was 142.9MB in the beginning and 168.5MB in the end (delta: -25.6MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.47ms. Allocated memory is still 192.9MB. Free memory was 168.5MB in the beginning and 167.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 357.02ms. Allocated memory is still 192.9MB. Free memory was 167.0MB in the beginning and 152.9MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 55.02ms. Allocated memory is still 192.9MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 73393.04ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 150.2MB in the beginning and 85.7MB in the end (delta: 64.5MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 26.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 822 SdHoareTripleChecker+Invalid, 26.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 326 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=6, InterpolantAutomatonStates: 46, 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, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 84 PreInvPairs, 99 NumberOfFragments, 495 HoareAnnotationTreeSize, 84 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 594 SizeOfPredicates, 7 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 11/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((p == 0 && n == r) && 1 <= counter) && h == 0) || !(\old(counter) <= 0)) || ((((p == 0 && n == r) && 0 <= counter) && h == 0) && q == 1)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 23:09:43,535 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...