/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/hard-u_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 00:27:49,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 00:27:49,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 00:27:49,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 00:27:49,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 00:27:49,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 00:27:49,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 00:27:49,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 00:27:49,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 00:27:49,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 00:27:49,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 00:27:49,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 00:27:49,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 00:27:49,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 00:27:49,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 00:27:49,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 00:27:49,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 00:27:49,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 00:27:49,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 00:27:49,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 00:27:49,609 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 00:27:49,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 00:27:49,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 00:27:49,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 00:27:49,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 00:27:49,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 00:27:49,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 00:27:49,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 00:27:49,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 00:27:49,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 00:27:49,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 00:27:49,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 00:27:49,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 00:27:49,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 00:27:49,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 00:27:49,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 00:27:49,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 00:27:49,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 00:27:49,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 00:27:49,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 00:27:49,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 00:27:49,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 00:27:49,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 00:27:49,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 00:27:49,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 00:27:49,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 00:27:49,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 00:27:49,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 00:27:49,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 00:27:49,664 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 00:27:49,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 00:27:49,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 00:27:49,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 00:27:49,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 00:27:49,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 00:27:49,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 00:27:49,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:27:49,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 00:27:49,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 00:27:49,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 00:27:49,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 00:27:49,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 00:27:49,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 00:27:49,667 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 00:27:49,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 00:27:49,668 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 00:27:49,669 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-28 00:27:49,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 00:27:49,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 00:27:49,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 00:27:49,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 00:27:49,899 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 00:27:49,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c [2022-04-28 00:27:49,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d149d1b2/915f8ac1f5ef4b0ea5f6f9c9e850478b/FLAG96cffa99c [2022-04-28 00:27:50,337 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 00:27:50,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c [2022-04-28 00:27:50,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d149d1b2/915f8ac1f5ef4b0ea5f6f9c9e850478b/FLAG96cffa99c [2022-04-28 00:27:50,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d149d1b2/915f8ac1f5ef4b0ea5f6f9c9e850478b [2022-04-28 00:27:50,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 00:27:50,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 00:27:50,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 00:27:50,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 00:27:50,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 00:27:50,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:50,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3735eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50, skipping insertion in model container [2022-04-28 00:27:50,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:50,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 00:27:50,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 00:27:50,936 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/hard-u_unwindbound5.c[537,550] [2022-04-28 00:27:50,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:27:50,963 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 00:27:50,974 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/hard-u_unwindbound5.c[537,550] [2022-04-28 00:27:50,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:27:50,994 INFO L208 MainTranslator]: Completed translation [2022-04-28 00:27:50,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50 WrapperNode [2022-04-28 00:27:50,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 00:27:50,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 00:27:50,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 00:27:50,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 00:27:51,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 00:27:51,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 00:27:51,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 00:27:51,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 00:27:51,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (1/1) ... [2022-04-28 00:27:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:27:51,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:27:51,093 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-28 00:27:51,119 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-28 00:27:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 00:27:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 00:27:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 00:27:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 00:27:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 00:27:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 00:27:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 00:27:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 00:27:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 00:27:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 00:27:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 00:27:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 00:27:51,204 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 00:27:51,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 00:27:51,423 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 00:27:51,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 00:27:51,430 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 00:27:51,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:27:51 BoogieIcfgContainer [2022-04-28 00:27:51,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 00:27:51,433 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 00:27:51,433 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 00:27:51,434 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 00:27:51,437 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:27:51" (1/1) ... [2022-04-28 00:27:51,439 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 00:27:51,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:27:51 BasicIcfg [2022-04-28 00:27:51,510 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 00:27:51,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 00:27:51,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 00:27:51,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 00:27:51,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:27:50" (1/4) ... [2022-04-28 00:27:51,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff59192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:27:51, skipping insertion in model container [2022-04-28 00:27:51,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:27:50" (2/4) ... [2022-04-28 00:27:51,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff59192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:27:51, skipping insertion in model container [2022-04-28 00:27:51,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:27:51" (3/4) ... [2022-04-28 00:27:51,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff59192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:27:51, skipping insertion in model container [2022-04-28 00:27:51,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:27:51" (4/4) ... [2022-04-28 00:27:51,520 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound5.cqvasr [2022-04-28 00:27:51,535 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 00:27:51,537 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 00:27:51,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 00:27:51,613 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@2230dca8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b400f02 [2022-04-28 00:27:51,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 00:27:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 00:27:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 00:27:51,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:51,633 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-28 00:27:51,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 79654685, now seen corresponding path program 1 times [2022-04-28 00:27:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:51,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839081400] [2022-04-28 00:27:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:27:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:51,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {40#true} is VALID [2022-04-28 00:27:51,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:27:51,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:27:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:27:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:51,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: 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] {40#true} is VALID [2022-04-28 00:27:51,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-28 00:27:51,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:27:51,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {40#true} is VALID [2022-04-28 00:27:51,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:27:51,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:27:51,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-28 00:27:51,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {40#true} is VALID [2022-04-28 00:27:51,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-28 00:27:51,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: 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] {40#true} is VALID [2022-04-28 00:27:51,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-28 00:27:51,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {41#false} is VALID [2022-04-28 00:27:51,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} [108] L35-3-->L53-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} [112] L53-2-->L45-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,895 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {41#false} is VALID [2022-04-28 00:27:51,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-28 00:27:51,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} [126] L15-->L16: 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[] {41#false} is VALID [2022-04-28 00:27:51,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-28 00:27:51,897 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-28 00:27:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:51,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839081400] [2022-04-28 00:27:51,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839081400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:51,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:51,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 00:27:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754554901] [2022-04-28 00:27:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:51,908 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-28 00:27:51,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:51,913 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-28 00:27:51,949 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-28 00:27:51,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 00:27:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:51,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 00:27:51,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:27:51,973 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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-28 00:27:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:52,222 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-28 00:27:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 00:27:52,223 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-28 00:27:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:27:52,225 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-28 00:27:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 00:27:52,250 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-28 00:27:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 00:27:52,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 00:27:52,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:52,405 INFO L225 Difference]: With dead ends: 66 [2022-04-28 00:27:52,405 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 00:27:52,408 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-28 00:27:52,411 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:27:52,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:27:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 00:27:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 00:27:52,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:27:52,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:52,438 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:52,439 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:52,443 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 00:27:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 00:27:52,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:52,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:52,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 00:27:52,445 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 00:27:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:52,449 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 00:27:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 00:27:52,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:52,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:52,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:27:52,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:27:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 00:27:52,457 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-28 00:27:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:27:52,457 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 00:27:52,458 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-28 00:27:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 00:27:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 00:27:52,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:52,459 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-28 00:27:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 00:27:52,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -85369733, now seen corresponding path program 1 times [2022-04-28 00:27:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:52,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259866069] [2022-04-28 00:27:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:27:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:52,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {256#true} is VALID [2022-04-28 00:27:52,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:27:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:52,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} [107] assume_abort_if_notENTRY-->L12: 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] {256#true} is VALID [2022-04-28 00:27:52,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [111] L12-->L12-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[] {256#true} is VALID [2022-04-28 00:27:52,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {256#true} is VALID [2022-04-28 00:27:52,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:27:52,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {256#true} is VALID [2022-04-28 00:27:52,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {256#true} is VALID [2022-04-28 00:27:52,589 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {256#true} is VALID [2022-04-28 00:27:52,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} [107] assume_abort_if_notENTRY-->L12: 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] {256#true} is VALID [2022-04-28 00:27:52,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} [111] L12-->L12-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[] {256#true} is VALID [2022-04-28 00:27:52,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-28 00:27:52,589 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {256#true} is VALID [2022-04-28 00:27:52,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {265#(= main_~q~0 0)} is VALID [2022-04-28 00:27:52,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {265#(= main_~q~0 0)} is VALID [2022-04-28 00:27:52,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {265#(= main_~q~0 0)} is VALID [2022-04-28 00:27:52,592 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 00:27:52,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: 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] {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 00:27:52,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: 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[] {257#false} is VALID [2022-04-28 00:27:52,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-28 00:27:52,597 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-28 00:27:52,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:52,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259866069] [2022-04-28 00:27:52,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259866069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:52,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:52,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:27:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718707711] [2022-04-28 00:27:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:52,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 00:27:52,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:52,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:27:52,617 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-28 00:27:52,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:27:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:52,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:27:52,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:27:52,623 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:27:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:53,090 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 00:27:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 00:27:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-28 00:27:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:27:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:27:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:27:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:27:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:27:53,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 00:27:53,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:53,174 INFO L225 Difference]: With dead ends: 47 [2022-04-28 00:27:53,174 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 00:27:53,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 00:27:53,177 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 00:27:53,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 00:27:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 00:27:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-28 00:27:53,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:27:53,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,198 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,200 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:53,213 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 00:27:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 00:27:53,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:53,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:53,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 00:27:53,217 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 00:27:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:53,220 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 00:27:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 00:27:53,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:53,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:53,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:27:53,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:27:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 00:27:53,224 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-28 00:27:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:27:53,224 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 00:27:53,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 00:27:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 00:27:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 00:27:53,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:53,225 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-28 00:27:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 00:27:53,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1527809342, now seen corresponding path program 1 times [2022-04-28 00:27:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:53,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361647855] [2022-04-28 00:27:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:53,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:27:53,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362627380] [2022-04-28 00:27:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:27:53,273 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-28 00:27:53,279 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-28 00:27:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:53,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 00:27:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:53,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:27:53,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-28 00:27:53,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: 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] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} [111] L12-->L12-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[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {497#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:53,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {531#(<= |main_#t~post6| 0)} is VALID [2022-04-28 00:27:53,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {490#false} is VALID [2022-04-28 00:27:53,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {490#false} is VALID [2022-04-28 00:27:53,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {490#false} is VALID [2022-04-28 00:27:53,485 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {490#false} is VALID [2022-04-28 00:27:53,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} [122] __VERIFIER_assertENTRY-->L15: 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] {490#false} is VALID [2022-04-28 00:27:53,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} [126] L15-->L16: 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[] {490#false} is VALID [2022-04-28 00:27:53,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-28 00:27:53,486 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-28 00:27:53,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:27:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:53,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361647855] [2022-04-28 00:27:53,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:27:53,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362627380] [2022-04-28 00:27:53,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362627380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:53,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:53,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 00:27:53,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959421681] [2022-04-28 00:27:53,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:53,488 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-28 00:27:53,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:53,488 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-28 00:27:53,506 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-28 00:27:53,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 00:27:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 00:27:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 00:27:53,508 INFO L87 Difference]: Start difference. First operand 36 states and 45 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-28 00:27:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:53,680 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-28 00:27:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 00:27:53,681 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-28 00:27:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:27:53,681 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-28 00:27:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 00:27:53,683 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-28 00:27:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 00:27:53,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 00:27:53,775 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-28 00:27:53,779 INFO L225 Difference]: With dead ends: 52 [2022-04-28 00:27:53,779 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 00:27:53,779 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-28 00:27:53,780 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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-28 00:27:53,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:27:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 00:27:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 00:27:53,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:27:53,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,799 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,800 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:53,804 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 00:27:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 00:27:53,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:53,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:53,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 00:27:53,807 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 00:27:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:53,812 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 00:27:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 00:27:53,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:53,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:53,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:27:53,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:27:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 00:27:53,825 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-28 00:27:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:27:53,825 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 00:27:53,825 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-28 00:27:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 00:27:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 00:27:53,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:53,826 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-28 00:27:53,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 00:27:54,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:54,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2128444854, now seen corresponding path program 1 times [2022-04-28 00:27:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:54,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775432385] [2022-04-28 00:27:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:27:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:54,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {757#true} is VALID [2022-04-28 00:27:54,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:27:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:54,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} [107] assume_abort_if_notENTRY-->L12: 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] {757#true} is VALID [2022-04-28 00:27:54,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} [111] L12-->L12-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[] {757#true} is VALID [2022-04-28 00:27:54,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {757#true} is VALID [2022-04-28 00:27:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 00:27:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:54,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} [122] __VERIFIER_assertENTRY-->L15: 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] {757#true} is VALID [2022-04-28 00:27:54,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} [127] L15-->L15-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[] {757#true} is VALID [2022-04-28 00:27:54,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:27:54,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:27:54,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {757#true} is VALID [2022-04-28 00:27:54,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {757#true} is VALID [2022-04-28 00:27:54,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {757#true} is VALID [2022-04-28 00:27:54,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} [107] assume_abort_if_notENTRY-->L12: 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] {757#true} is VALID [2022-04-28 00:27:54,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} [111] L12-->L12-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[] {757#true} is VALID [2022-04-28 00:27:54,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {757#true} is VALID [2022-04-28 00:27:54,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:27:54,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:27:54,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:27:54,162 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {757#true} is VALID [2022-04-28 00:27:54,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} [122] __VERIFIER_assertENTRY-->L15: 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] {757#true} is VALID [2022-04-28 00:27:54,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} [127] L15-->L15-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[] {757#true} is VALID [2022-04-28 00:27:54,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#true} is VALID [2022-04-28 00:27:54,163 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 00:27:54,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 00:27:54,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: 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] {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 00:27:54,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: 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[] {758#false} is VALID [2022-04-28 00:27:54,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {758#false} is VALID [2022-04-28 00:27:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 00:27:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:54,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775432385] [2022-04-28 00:27:54,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775432385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:54,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:54,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:27:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548816366] [2022-04-28 00:27:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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 23 [2022-04-28 00:27:54,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:54,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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-28 00:27:54,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:54,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:27:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:27:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:27:54,187 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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-28 00:27:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:54,601 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 00:27:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 00:27:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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 23 [2022-04-28 00:27:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:27:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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-28 00:27:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:27:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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-28 00:27:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 00:27:54,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 00:27:54,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:54,675 INFO L225 Difference]: With dead ends: 52 [2022-04-28 00:27:54,675 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 00:27:54,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 00:27:54,676 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 00:27:54,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 00:27:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 00:27:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-28 00:27:54,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:27:54,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:54,687 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:54,687 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:54,690 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 00:27:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:27:54,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:54,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:54,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 00:27:54,691 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 00:27:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:54,693 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 00:27:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 00:27:54,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:54,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:54,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:27:54,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:27:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 00:27:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 00:27:54,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-28 00:27:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:27:54,696 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 00:27:54,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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-28 00:27:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 00:27:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 00:27:54,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:54,697 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:27:54,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 00:27:54,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 135546551, now seen corresponding path program 1 times [2022-04-28 00:27:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:54,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182312664] [2022-04-28 00:27:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:54,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:27:54,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936962666] [2022-04-28 00:27:54,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:54,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:27:54,713 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-28 00:27:54,719 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-28 00:27:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:54,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:27:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:54,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:27:54,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {1018#true} is VALID [2022-04-28 00:27:54,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1018#true} is VALID [2022-04-28 00:27:54,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1018#true} is VALID [2022-04-28 00:27:54,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} [107] assume_abort_if_notENTRY-->L12: 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] {1018#true} is VALID [2022-04-28 00:27:54,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} [111] L12-->L12-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[] {1018#true} is VALID [2022-04-28 00:27:54,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,954 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1018#true} is VALID [2022-04-28 00:27:54,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:27:54,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:27:54,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:27:54,958 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1018#true} is VALID [2022-04-28 00:27:54,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1018#true} is VALID [2022-04-28 00:27:54,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} [127] L15-->L15-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[] {1018#true} is VALID [2022-04-28 00:27:54,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,959 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:27:54,960 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1018#true} is VALID [2022-04-28 00:27:54,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1018#true} is VALID [2022-04-28 00:27:54,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} [127] L15-->L15-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[] {1018#true} is VALID [2022-04-28 00:27:54,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#true} is VALID [2022-04-28 00:27:54,961 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:27:54,962 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:27:54,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: 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] {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:27:54,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: 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[] {1019#false} is VALID [2022-04-28 00:27:54,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#false} is VALID [2022-04-28 00:27:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 00:27:54,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:27:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182312664] [2022-04-28 00:27:54,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:27:54,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936962666] [2022-04-28 00:27:54,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936962666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:54,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:54,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:27:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829050705] [2022-04-28 00:27:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:54,965 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 00:27:54,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:54,965 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:27:54,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:54,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:27:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:27:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:27:54,985 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:27:57,176 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-28 00:27:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:57,370 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 00:27:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:27:57,370 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 00:27:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:27:57,370 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:27:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 00:27:57,373 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:27:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 00:27:57,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-28 00:27:57,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:57,452 INFO L225 Difference]: With dead ends: 59 [2022-04-28 00:27:57,452 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 00:27:57,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-28 00:27:57,454 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:27:57,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 00:27:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 00:27:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 00:27:57,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:27:57,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:57,464 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:57,465 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:57,468 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 00:27:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 00:27:57,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:57,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:57,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 00:27:57,469 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 00:27:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:57,472 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 00:27:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 00:27:57,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:57,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:57,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:27:57,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:27:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-28 00:27:57,476 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-28 00:27:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:27:57,476 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-28 00:27:57,476 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 00:27:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 00:27:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 00:27:57,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:57,477 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:27:57,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 00:27:57,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:57,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1016025214, now seen corresponding path program 1 times [2022-04-28 00:27:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:57,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032274709] [2022-04-28 00:27:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:57,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:27:57,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938156098] [2022-04-28 00:27:57,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:57,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:57,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:27:57,731 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-28 00:27:57,733 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-28 00:27:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:57,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:27:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:57,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:27:58,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#true} is VALID [2022-04-28 00:27:58,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1394#(<= ~counter~0 0)} {1386#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {1394#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: 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] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~counter~0 0)} [111] L12-->L12-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[] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1394#(<= ~counter~0 0)} {1394#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1394#(<= ~counter~0 0)} is VALID [2022-04-28 00:27:58,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#(<= ~counter~0 1)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,078 INFO L272 TraceCheckUtils]: 14: Hoare triple {1428#(<= ~counter~0 1)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(<= ~counter~0 1)} [127] L15-->L15-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[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {1428#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,080 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {1428#(<= ~counter~0 1)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(<= ~counter~0 1)} [127] L15-->L15-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[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,082 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,082 INFO L272 TraceCheckUtils]: 24: Hoare triple {1428#(<= ~counter~0 1)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {1428#(<= ~counter~0 1)} [127] L15-->L15-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[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {1428#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,084 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {1428#(<= ~counter~0 1)} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1428#(<= ~counter~0 1)} is VALID [2022-04-28 00:27:58,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {1428#(<= ~counter~0 1)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1483#(<= |main_#t~post7| 1)} is VALID [2022-04-28 00:27:58,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |main_#t~post7| 1)} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1387#false} is VALID [2022-04-28 00:27:58,087 INFO L272 TraceCheckUtils]: 32: Hoare triple {1387#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1387#false} is VALID [2022-04-28 00:27:58,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {1387#false} [122] __VERIFIER_assertENTRY-->L15: 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] {1387#false} is VALID [2022-04-28 00:27:58,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {1387#false} [126] L15-->L16: 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[] {1387#false} is VALID [2022-04-28 00:27:58,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1387#false} is VALID [2022-04-28 00:27:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:27:58,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:27:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:58,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032274709] [2022-04-28 00:27:58,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:27:58,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938156098] [2022-04-28 00:27:58,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938156098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:58,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:58,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:27:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805987659] [2022-04-28 00:27:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 00:27:58,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:58,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 00:27:58,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:58,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:27:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:58,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:27:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:27:58,149 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 00:27:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:58,418 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-28 00:27:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:27:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 00:27:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:27:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 00:27:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 00:27:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 00:27:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 00:27:58,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 00:27:58,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:58,483 INFO L225 Difference]: With dead ends: 76 [2022-04-28 00:27:58,483 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 00:27:58,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-28 00:27:58,484 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:27:58,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:27:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 00:27:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 00:27:58,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:27:58,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:58,500 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:58,500 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:58,502 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 00:27:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 00:27:58,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:58,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:58,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 00:27:58,504 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 00:27:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:27:58,506 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 00:27:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 00:27:58,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:27:58,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:27:58,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:27:58,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:27:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 00:27:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-28 00:27:58,510 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-28 00:27:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:27:58,510 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-28 00:27:58,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 00:27:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-28 00:27:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 00:27:58,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:27:58,511 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:27:58,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 00:27:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:58,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:27:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:27:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1017127481, now seen corresponding path program 1 times [2022-04-28 00:27:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:27:58,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452603117] [2022-04-28 00:27:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:27:58,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:27:58,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357161488] [2022-04-28 00:27:58,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:27:58,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:27:58,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:27:58,758 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-28 00:27:58,768 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-28 00:27:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:58,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 00:27:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:27:58,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:27:59,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1839#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1839#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {1839#true} is VALID [2022-04-28 00:27:59,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#true} {1839#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1839#true} is VALID [2022-04-28 00:27:59,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1839#true} is VALID [2022-04-28 00:27:59,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#true} [107] assume_abort_if_notENTRY-->L12: 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] {1839#true} is VALID [2022-04-28 00:27:59,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#true} [111] L12-->L12-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[] {1839#true} is VALID [2022-04-28 00:27:59,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {1839#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,574 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1839#true} {1839#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1839#true} is VALID [2022-04-28 00:27:59,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 00:27:59,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 00:27:59,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 00:27:59,578 INFO L272 TraceCheckUtils]: 14: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1839#true} is VALID [2022-04-28 00:27:59,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1839#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1839#true} is VALID [2022-04-28 00:27:59,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#true} [127] L15-->L15-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[] {1839#true} is VALID [2022-04-28 00:27:59,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,582 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 00:27:59,583 INFO L272 TraceCheckUtils]: 19: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1839#true} is VALID [2022-04-28 00:27:59,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1839#true} is VALID [2022-04-28 00:27:59,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#true} [127] L15-->L15-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[] {1839#true} is VALID [2022-04-28 00:27:59,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {1839#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,584 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 00:27:59,584 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1839#true} is VALID [2022-04-28 00:27:59,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {1839#true} [122] __VERIFIER_assertENTRY-->L15: 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] {1839#true} is VALID [2022-04-28 00:27:59,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {1839#true} [127] L15-->L15-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[] {1839#true} is VALID [2022-04-28 00:27:59,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1839#true} is VALID [2022-04-28 00:27:59,585 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 00:27:59,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 00:27:59,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 00:27:59,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [119] L45-->L46: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 00:27:59,596 INFO L272 TraceCheckUtils]: 32: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [123] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:27:59,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: 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] {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:27:59,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: 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[] {1840#false} is VALID [2022-04-28 00:27:59,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {1840#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1840#false} is VALID [2022-04-28 00:27:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:27:59,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:27:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:27:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452603117] [2022-04-28 00:27:59,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:27:59,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357161488] [2022-04-28 00:27:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357161488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:27:59,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:27:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 00:27:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272173821] [2022-04-28 00:27:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:27:59,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 00:27:59,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:27:59,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:27:59,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:27:59,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:27:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:27:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:27:59,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 00:27:59,638 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:28:02,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 00:28:04,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 00:28:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:04,883 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-28 00:28:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 00:28:04,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 00:28:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:28:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:28:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 00:28:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:28:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 00:28:04,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-28 00:28:04,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:04,993 INFO L225 Difference]: With dead ends: 82 [2022-04-28 00:28:04,993 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 00:28:04,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 00:28:04,994 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 00:28:04,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 00:28:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 00:28:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-28 00:28:05,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:28:05,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:28:05,015 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:28:05,015 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:28:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:05,018 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 00:28:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 00:28:05,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:05,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:05,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-28 00:28:05,020 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-28 00:28:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:05,022 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 00:28:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 00:28:05,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:05,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:05,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:28:05,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:28:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 00:28:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-28 00:28:05,026 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-28 00:28:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:28:05,027 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-28 00:28:05,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 00:28:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-28 00:28:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 00:28:05,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:28:05,028 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:28:05,053 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-28 00:28:05,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:05,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:28:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:28:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1880362404, now seen corresponding path program 1 times [2022-04-28 00:28:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:28:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973746507] [2022-04-28 00:28:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:28:05,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:28:05,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453724040] [2022-04-28 00:28:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:05,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:05,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:28:05,268 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-28 00:28:05,273 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-28 00:28:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:28:05,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:28:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:28:05,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:28:05,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-28 00:28:05,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: 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] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= ~counter~0 0)} [111] L12-->L12-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[] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(<= ~counter~0 0)} {2346#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2346#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:05,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,559 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#(<= ~counter~0 1)} [127] L15-->L15-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[] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,561 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,562 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~counter~0 1)} [127] L15-->L15-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[] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,564 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,565 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#(<= ~counter~0 1)} [127] L15-->L15-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[] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,567 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2380#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:05,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-28 00:28:05,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2339#false} is VALID [2022-04-28 00:28:05,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2339#false} is VALID [2022-04-28 00:28:05,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2339#false} is VALID [2022-04-28 00:28:05,568 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2339#false} is VALID [2022-04-28 00:28:05,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} [122] __VERIFIER_assertENTRY-->L15: 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] {2339#false} is VALID [2022-04-28 00:28:05,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} [126] L15-->L16: 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[] {2339#false} is VALID [2022-04-28 00:28:05,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-28 00:28:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:28:05,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 00:28:05,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-28 00:28:05,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} [126] L15-->L16: 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[] {2339#false} is VALID [2022-04-28 00:28:05,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} [122] __VERIFIER_assertENTRY-->L15: 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] {2339#false} is VALID [2022-04-28 00:28:05,839 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2339#false} is VALID [2022-04-28 00:28:05,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2339#false} is VALID [2022-04-28 00:28:05,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2339#false} is VALID [2022-04-28 00:28:05,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {2475#(< |main_#t~post6| 5)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2339#false} is VALID [2022-04-28 00:28:05,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {2479#(< ~counter~0 5)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2475#(< |main_#t~post6| 5)} is VALID [2022-04-28 00:28:05,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {2479#(< ~counter~0 5)} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2479#(< ~counter~0 5)} is VALID [2022-04-28 00:28:05,842 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2479#(< ~counter~0 5)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2479#(< ~counter~0 5)} is VALID [2022-04-28 00:28:05,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-28 00:28:05,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} [127] L15-->L15-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[] {2338#true} is VALID [2022-04-28 00:28:05,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} [122] __VERIFIER_assertENTRY-->L15: 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] {2338#true} is VALID [2022-04-28 00:28:05,843 INFO L272 TraceCheckUtils]: 24: Hoare triple {2479#(< ~counter~0 5)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2338#true} is VALID [2022-04-28 00:28:05,847 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2338#true} {2479#(< ~counter~0 5)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2479#(< ~counter~0 5)} is VALID [2022-04-28 00:28:05,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-28 00:28:05,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#true} [127] L15-->L15-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[] {2338#true} is VALID [2022-04-28 00:28:05,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} [122] __VERIFIER_assertENTRY-->L15: 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] {2338#true} is VALID [2022-04-28 00:28:05,847 INFO L272 TraceCheckUtils]: 19: Hoare triple {2479#(< ~counter~0 5)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2338#true} is VALID [2022-04-28 00:28:05,848 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2338#true} {2479#(< ~counter~0 5)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2479#(< ~counter~0 5)} is VALID [2022-04-28 00:28:05,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {2338#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-28 00:28:05,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#true} [127] L15-->L15-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[] {2338#true} is VALID [2022-04-28 00:28:05,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} [122] __VERIFIER_assertENTRY-->L15: 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] {2338#true} is VALID [2022-04-28 00:28:05,848 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(< ~counter~0 5)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2338#true} is VALID [2022-04-28 00:28:05,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(< ~counter~0 5)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2479#(< ~counter~0 5)} is VALID [2022-04-28 00:28:05,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(< ~counter~0 4)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2479#(< ~counter~0 5)} is VALID [2022-04-28 00:28:05,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {2534#(< ~counter~0 4)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2534#(< ~counter~0 4)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-28 00:28:05,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} [111] L12-->L12-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[] {2338#true} is VALID [2022-04-28 00:28:05,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} [107] assume_abort_if_notENTRY-->L12: 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] {2338#true} is VALID [2022-04-28 00:28:05,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {2534#(< ~counter~0 4)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2338#true} is VALID [2022-04-28 00:28:05,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {2534#(< ~counter~0 4)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {2534#(< ~counter~0 4)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2534#(< ~counter~0 4)} {2338#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {2534#(< ~counter~0 4)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {2534#(< ~counter~0 4)} is VALID [2022-04-28 00:28:05,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-28 00:28:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 00:28:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:28:05,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973746507] [2022-04-28 00:28:05,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:28:05,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453724040] [2022-04-28 00:28:05,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453724040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 00:28:05,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 00:28:05,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 00:28:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064406276] [2022-04-28 00:28:05,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 00:28:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-28 00:28:05,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:28:05,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 00:28:05,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:05,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 00:28:05,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:28:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 00:28:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 00:28:05,908 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 00:28:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:06,544 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-28 00:28:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 00:28:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-28 00:28:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:28:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 00:28:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-28 00:28:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 00:28:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-28 00:28:06,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-28 00:28:06,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:06,681 INFO L225 Difference]: With dead ends: 160 [2022-04-28 00:28:06,681 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 00:28:06,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 00:28:06,682 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 00:28:06,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 180 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 00:28:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 00:28:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-04-28 00:28:06,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:28:06,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 00:28:06,739 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 00:28:06,740 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 00:28:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:06,744 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-28 00:28:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-28 00:28:06,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:06,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:06,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-28 00:28:06,746 INFO L87 Difference]: Start difference. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-28 00:28:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:06,751 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-28 00:28:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-28 00:28:06,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:06,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:06,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:28:06,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:28:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 00:28:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-04-28 00:28:06,756 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 38 [2022-04-28 00:28:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:28:06,757 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-04-28 00:28:06,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 00:28:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-28 00:28:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 00:28:06,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:28:06,759 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:28:06,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 00:28:06,979 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-28 00:28:06,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:28:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:28:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1525733273, now seen corresponding path program 1 times [2022-04-28 00:28:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:28:06,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988878645] [2022-04-28 00:28:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:06,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:28:06,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:28:06,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165524418] [2022-04-28 00:28:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:06,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:28:06,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:28:07,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 00:28:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:28:07,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 00:28:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:28:07,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:28:08,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3284#true} is VALID [2022-04-28 00:28:08,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} [107] assume_abort_if_notENTRY-->L12: 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] {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 00:28:08,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [111] L12-->L12-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[] {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 00:28:08,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 00:28:08,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} {3284#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3321#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-28 00:28:08,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {3321#(<= 1 (mod main_~B~0 4294967296))} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:28:08,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:28:08,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:28:08,280 INFO L272 TraceCheckUtils]: 14: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3284#true} is VALID [2022-04-28 00:28:08,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,281 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:28:08,281 INFO L272 TraceCheckUtils]: 19: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3284#true} is VALID [2022-04-28 00:28:08,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,282 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:28:08,282 INFO L272 TraceCheckUtils]: 24: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3284#true} is VALID [2022-04-28 00:28:08,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,284 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 00:28:08,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 00:28:08,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 00:28:08,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 00:28:08,285 INFO L272 TraceCheckUtils]: 32: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3284#true} is VALID [2022-04-28 00:28:08,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,286 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 00:28:08,286 INFO L272 TraceCheckUtils]: 37: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3284#true} is VALID [2022-04-28 00:28:08,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,292 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 00:28:08,302 INFO L272 TraceCheckUtils]: 42: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:28:08,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: 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] {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:28:08,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: 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[] {3285#false} is VALID [2022-04-28 00:28:08,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3285#false} is VALID [2022-04-28 00:28:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 00:28:08,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 00:28:08,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3285#false} is VALID [2022-04-28 00:28:08,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: 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[] {3285#false} is VALID [2022-04-28 00:28:08,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: 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] {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:28:08,828 INFO L272 TraceCheckUtils]: 42: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:28:08,828 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 00:28:08,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,828 INFO L272 TraceCheckUtils]: 37: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3284#true} is VALID [2022-04-28 00:28:08,829 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 00:28:08,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:08,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:08,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:08,829 INFO L272 TraceCheckUtils]: 32: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3284#true} is VALID [2022-04-28 00:28:08,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 00:28:08,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 00:28:10,836 WARN L290 TraceCheckUtils]: 29: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-28 00:28:10,837 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 00:28:10,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:10,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:10,837 INFO L272 TraceCheckUtils]: 24: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3284#true} is VALID [2022-04-28 00:28:10,837 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 00:28:10,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:10,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:10,838 INFO L272 TraceCheckUtils]: 19: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3284#true} is VALID [2022-04-28 00:28:10,838 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 00:28:10,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} [127] L15-->L15-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[] {3284#true} is VALID [2022-04-28 00:28:10,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} [122] __VERIFIER_assertENTRY-->L15: 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] {3284#true} is VALID [2022-04-28 00:28:10,839 INFO L272 TraceCheckUtils]: 14: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3284#true} is VALID [2022-04-28 00:28:10,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 00:28:10,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 00:28:10,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 00:28:10,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3284#true} {3284#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3284#true} is VALID [2022-04-28 00:28:10,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {3284#true} [111] L12-->L12-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[] {3284#true} is VALID [2022-04-28 00:28:10,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} [107] assume_abort_if_notENTRY-->L12: 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] {3284#true} is VALID [2022-04-28 00:28:10,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3284#true} is VALID [2022-04-28 00:28:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 00:28:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:28:10,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988878645] [2022-04-28 00:28:10,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:28:10,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165524418] [2022-04-28 00:28:10,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165524418] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 00:28:10,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 00:28:10,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-28 00:28:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292803932] [2022-04-28 00:28:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:28:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-28 00:28:10,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:28:10,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 00:28:12,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:12,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 00:28:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:28:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 00:28:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 00:28:12,885 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 00:28:16,266 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-28 00:28:19,724 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-28 00:28:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:21,101 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-04-28 00:28:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:28:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-28 00:28:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:28:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 00:28:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 00:28:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 00:28:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 00:28:21,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 00:28:23,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:23,190 INFO L225 Difference]: With dead ends: 162 [2022-04-28 00:28:23,190 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 00:28:23,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 00:28:23,191 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 00:28:23,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 00:28:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 00:28:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-04-28 00:28:23,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:28:23,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 00:28:23,246 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 00:28:23,246 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 00:28:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:23,251 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-28 00:28:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-28 00:28:23,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:23,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:23,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-28 00:28:23,253 INFO L87 Difference]: Start difference. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-28 00:28:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:23,257 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-28 00:28:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-28 00:28:23,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:23,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:23,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:28:23,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:28:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 00:28:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2022-04-28 00:28:23,262 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 46 [2022-04-28 00:28:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:28:23,262 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2022-04-28 00:28:23,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 00:28:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2022-04-28 00:28:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 00:28:23,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:28:23,264 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:28:23,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 00:28:23,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:23,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:28:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:28:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash 450187565, now seen corresponding path program 1 times [2022-04-28 00:28:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:28:23,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456561991] [2022-04-28 00:28:23,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:28:23,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:28:23,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458555492] [2022-04-28 00:28:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:23,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:28:23,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:28:23,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 00:28:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:28:23,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 00:28:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:28:23,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:28:23,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:23,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {4342#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4342#(<= ~counter~0 0)} {4334#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {4342#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {4342#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {4342#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: 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] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(<= ~counter~0 0)} [111] L12-->L12-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[] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4342#(<= ~counter~0 0)} {4342#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {4342#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {4342#(<= ~counter~0 0)} is VALID [2022-04-28 00:28:23,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {4342#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {4376#(<= ~counter~0 1)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,848 INFO L272 TraceCheckUtils]: 14: Hoare triple {4376#(<= ~counter~0 1)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {4376#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(<= ~counter~0 1)} [127] L15-->L15-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[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {4376#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,850 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,851 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(<= ~counter~0 1)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {4376#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {4376#(<= ~counter~0 1)} [127] L15-->L15-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[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {4376#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,853 INFO L272 TraceCheckUtils]: 24: Hoare triple {4376#(<= ~counter~0 1)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: 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] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {4376#(<= ~counter~0 1)} [127] L15-->L15-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[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {4376#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,855 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {4376#(<= ~counter~0 1)} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {4376#(<= ~counter~0 1)} is VALID [2022-04-28 00:28:23,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {4376#(<= ~counter~0 1)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#(<= ~counter~0 2)} [119] L45-->L46: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,858 INFO L272 TraceCheckUtils]: 32: Hoare triple {4431#(<= ~counter~0 2)} [123] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#(<= ~counter~0 2)} [122] __VERIFIER_assertENTRY-->L15: 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] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#(<= ~counter~0 2)} [127] L15-->L15-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[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(<= ~counter~0 2)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,860 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} [146] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,860 INFO L272 TraceCheckUtils]: 37: Hoare triple {4431#(<= ~counter~0 2)} [128] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {4431#(<= ~counter~0 2)} [122] __VERIFIER_assertENTRY-->L15: 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] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {4431#(<= ~counter~0 2)} [127] L15-->L15-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[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(<= ~counter~0 2)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,862 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} [147] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {4431#(<= ~counter~0 2)} [135] L47-->L53: Formula: (let ((.cse0 (mod v_main_~p~0_9 4294967296))) (and (= v_main_~p~0_8 (div .cse0 2)) (not (= .cse0 1)) (= v_main_~d~0_8 (div (mod v_main_~d~0_9 4294967296) 2)))) InVars {main_~p~0=v_main_~p~0_9, main_~d~0=v_main_~d~0_9} OutVars{main_~p~0=v_main_~p~0_8, main_~d~0=v_main_~d~0_8} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(<= ~counter~0 2)} [138] L53-->L53-2: Formula: (and (= v_main_~q~0_5 (+ v_main_~p~0_10 v_main_~q~0_6)) (= v_main_~r~0_7 (+ v_main_~r~0_8 (* (- 1) v_main_~d~0_10))) (<= (mod v_main_~d~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_6, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:23,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {4431#(<= ~counter~0 2)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4474#(<= |main_#t~post7| 2)} is VALID [2022-04-28 00:28:23,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {4474#(<= |main_#t~post7| 2)} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4335#false} is VALID [2022-04-28 00:28:23,864 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {4335#false} is VALID [2022-04-28 00:28:23,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} [122] __VERIFIER_assertENTRY-->L15: 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] {4335#false} is VALID [2022-04-28 00:28:23,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} [126] L15-->L16: 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[] {4335#false} is VALID [2022-04-28 00:28:23,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4335#false} is VALID [2022-04-28 00:28:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 00:28:23,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 00:28:24,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4335#false} is VALID [2022-04-28 00:28:24,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} [126] L15-->L16: 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[] {4335#false} is VALID [2022-04-28 00:28:24,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} [122] __VERIFIER_assertENTRY-->L15: 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] {4335#false} is VALID [2022-04-28 00:28:24,154 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {4335#false} is VALID [2022-04-28 00:28:24,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {4502#(< |main_#t~post7| 5)} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4335#false} is VALID [2022-04-28 00:28:24,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {4506#(< ~counter~0 5)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4502#(< |main_#t~post7| 5)} is VALID [2022-04-28 00:28:24,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {4506#(< ~counter~0 5)} [138] L53-->L53-2: Formula: (and (= v_main_~q~0_5 (+ v_main_~p~0_10 v_main_~q~0_6)) (= v_main_~r~0_7 (+ v_main_~r~0_8 (* (- 1) v_main_~d~0_10))) (<= (mod v_main_~d~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_6, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4506#(< ~counter~0 5)} is VALID [2022-04-28 00:28:24,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {4506#(< ~counter~0 5)} [135] L47-->L53: Formula: (let ((.cse0 (mod v_main_~p~0_9 4294967296))) (and (= v_main_~p~0_8 (div .cse0 2)) (not (= .cse0 1)) (= v_main_~d~0_8 (div (mod v_main_~d~0_9 4294967296) 2)))) InVars {main_~p~0=v_main_~p~0_9, main_~d~0=v_main_~d~0_9} OutVars{main_~p~0=v_main_~p~0_8, main_~d~0=v_main_~d~0_8} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {4506#(< ~counter~0 5)} is VALID [2022-04-28 00:28:24,156 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4334#true} {4506#(< ~counter~0 5)} [147] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4506#(< ~counter~0 5)} is VALID [2022-04-28 00:28:24,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {4334#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {4334#true} [127] L15-->L15-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[] {4334#true} is VALID [2022-04-28 00:28:24,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {4334#true} [122] __VERIFIER_assertENTRY-->L15: 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] {4334#true} is VALID [2022-04-28 00:28:24,156 INFO L272 TraceCheckUtils]: 37: Hoare triple {4506#(< ~counter~0 5)} [128] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4334#true} is VALID [2022-04-28 00:28:24,157 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4334#true} {4506#(< ~counter~0 5)} [146] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4506#(< ~counter~0 5)} is VALID [2022-04-28 00:28:24,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {4334#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {4334#true} [127] L15-->L15-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[] {4334#true} is VALID [2022-04-28 00:28:24,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {4334#true} [122] __VERIFIER_assertENTRY-->L15: 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] {4334#true} is VALID [2022-04-28 00:28:24,157 INFO L272 TraceCheckUtils]: 32: Hoare triple {4506#(< ~counter~0 5)} [123] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {4334#true} is VALID [2022-04-28 00:28:24,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {4506#(< ~counter~0 5)} [119] L45-->L46: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4506#(< ~counter~0 5)} is VALID [2022-04-28 00:28:24,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {4549#(< ~counter~0 4)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4506#(< ~counter~0 5)} is VALID [2022-04-28 00:28:24,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {4549#(< ~counter~0 4)} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {4549#(< ~counter~0 4)} is VALID [2022-04-28 00:28:24,160 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#true} {4549#(< ~counter~0 4)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4549#(< ~counter~0 4)} is VALID [2022-04-28 00:28:24,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {4334#true} [127] L15-->L15-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[] {4334#true} is VALID [2022-04-28 00:28:24,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {4334#true} [122] __VERIFIER_assertENTRY-->L15: 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] {4334#true} is VALID [2022-04-28 00:28:24,160 INFO L272 TraceCheckUtils]: 24: Hoare triple {4549#(< ~counter~0 4)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {4334#true} is VALID [2022-04-28 00:28:24,161 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#true} {4549#(< ~counter~0 4)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4549#(< ~counter~0 4)} is VALID [2022-04-28 00:28:24,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {4334#true} [127] L15-->L15-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[] {4334#true} is VALID [2022-04-28 00:28:24,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#true} [122] __VERIFIER_assertENTRY-->L15: 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] {4334#true} is VALID [2022-04-28 00:28:24,161 INFO L272 TraceCheckUtils]: 19: Hoare triple {4549#(< ~counter~0 4)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {4334#true} is VALID [2022-04-28 00:28:24,161 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4334#true} {4549#(< ~counter~0 4)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4549#(< ~counter~0 4)} is VALID [2022-04-28 00:28:24,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#true} [127] L15-->L15-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[] {4334#true} is VALID [2022-04-28 00:28:24,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#true} [122] __VERIFIER_assertENTRY-->L15: 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] {4334#true} is VALID [2022-04-28 00:28:24,162 INFO L272 TraceCheckUtils]: 14: Hoare triple {4549#(< ~counter~0 4)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {4334#true} is VALID [2022-04-28 00:28:24,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {4549#(< ~counter~0 4)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4549#(< ~counter~0 4)} is VALID [2022-04-28 00:28:24,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {4431#(<= ~counter~0 2)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4549#(< ~counter~0 4)} is VALID [2022-04-28 00:28:24,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {4431#(<= ~counter~0 2)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4334#true} {4431#(<= ~counter~0 2)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#true} [111] L12-->L12-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[] {4334#true} is VALID [2022-04-28 00:28:24,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#true} [107] assume_abort_if_notENTRY-->L12: 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] {4334#true} is VALID [2022-04-28 00:28:24,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {4431#(<= ~counter~0 2)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {4334#true} is VALID [2022-04-28 00:28:24,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {4431#(<= ~counter~0 2)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {4431#(<= ~counter~0 2)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4431#(<= ~counter~0 2)} {4334#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {4431#(<= ~counter~0 2)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#true} [101] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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] {4431#(<= ~counter~0 2)} is VALID [2022-04-28 00:28:24,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4334#true} is VALID [2022-04-28 00:28:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 00:28:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:28:24,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456561991] [2022-04-28 00:28:24,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:28:24,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458555492] [2022-04-28 00:28:24,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458555492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 00:28:24,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 00:28:24,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 00:28:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95066087] [2022-04-28 00:28:24,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 00:28:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 50 [2022-04-28 00:28:24,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:28:24,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 00:28:24,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:24,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 00:28:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:28:24,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 00:28:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 00:28:24,246 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 00:28:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:27,221 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2022-04-28 00:28:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 00:28:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 50 [2022-04-28 00:28:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:28:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 00:28:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 00:28:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 00:28:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 00:28:27,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-28 00:28:27,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:28:27,391 INFO L225 Difference]: With dead ends: 234 [2022-04-28 00:28:27,391 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 00:28:27,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-28 00:28:27,392 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 00:28:27,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 00:28:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 00:28:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2022-04-28 00:28:27,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:28:27,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 00:28:27,468 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 00:28:27,468 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 00:28:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:27,474 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-28 00:28:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-28 00:28:27,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:27,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:27,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) Second operand 210 states. [2022-04-28 00:28:27,476 INFO L87 Difference]: Start difference. First operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) Second operand 210 states. [2022-04-28 00:28:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:28:27,481 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-28 00:28:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-28 00:28:27,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:28:27,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:28:27,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:28:27,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:28:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 141 states have internal predecessors, (157), 47 states have call successors, (47), 26 states have call predecessors, (47), 25 states have return successors, (43), 37 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 00:28:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2022-04-28 00:28:27,488 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 50 [2022-04-28 00:28:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:28:27,488 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2022-04-28 00:28:27,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 00:28:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2022-04-28 00:28:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 00:28:27,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:28:27,489 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1] [2022-04-28 00:28:27,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 00:28:27,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:27,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:28:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:28:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 451289832, now seen corresponding path program 1 times [2022-04-28 00:28:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:28:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872685159] [2022-04-28 00:28:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:28:27,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:28:27,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770308296] [2022-04-28 00:28:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:28:27,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:28:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:28:27,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 00:28:27,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process