/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/divbin_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 00:34:26,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 00:34:26,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 00:34:26,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 00:34:26,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 00:34:26,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 00:34:26,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 00:34:26,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 00:34:26,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 00:34:26,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 00:34:26,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 00:34:26,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 00:34:26,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 00:34:26,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 00:34:26,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 00:34:26,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 00:34:26,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 00:34:26,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 00:34:26,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 00:34:26,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 00:34:26,185 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 00:34:26,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 00:34:26,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 00:34:26,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 00:34:26,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 00:34:26,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 00:34:26,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 00:34:26,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 00:34:26,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 00:34:26,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 00:34:26,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 00:34:26,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 00:34:26,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 00:34:26,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 00:34:26,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 00:34:26,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 00:34:26,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 00:34:26,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 00:34:26,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 00:34:26,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 00:34:26,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 00:34:26,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 00:34:26,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 00:34:26,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 00:34:26,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 00:34:26,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 00:34:26,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 00:34:26,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 00:34:26,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 00:34:26,228 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 00:34:26,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 00:34:26,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 00:34:26,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 00:34:26,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 00:34:26,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 00:34:26,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 00:34:26,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 00:34:26,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 00:34:26,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 00:34:26,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 00:34:26,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 00:34:26,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 00:34:26,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:34:26,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 00:34:26,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 00:34:26,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 00:34:26,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 00:34:26,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 00:34:26,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 00:34:26,231 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 00:34:26,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 00:34:26,232 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 00:34:26,233 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-08 00:34:26,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 00:34:26,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 00:34:26,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 00:34:26,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 00:34:26,453 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 00:34:26,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-08 00:34:26,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c0588ea/da538ae1a26b49bd81fdcf5a502e3788/FLAG58d732f8d [2022-04-08 00:34:26,897 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 00:34:26,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-08 00:34:26,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c0588ea/da538ae1a26b49bd81fdcf5a502e3788/FLAG58d732f8d [2022-04-08 00:34:26,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c0588ea/da538ae1a26b49bd81fdcf5a502e3788 [2022-04-08 00:34:26,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 00:34:26,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 00:34:26,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 00:34:26,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 00:34:26,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 00:34:26,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:34:26" (1/1) ... [2022-04-08 00:34:26,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f4b12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:26, skipping insertion in model container [2022-04-08 00:34:26,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:34:26" (1/1) ... [2022-04-08 00:34:26,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 00:34:26,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 00:34:27,110 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/divbin_valuebound100.i[950,963] [2022-04-08 00:34:27,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:34:27,151 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 00:34:27,159 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/divbin_valuebound100.i[950,963] [2022-04-08 00:34:27,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:34:27,172 INFO L208 MainTranslator]: Completed translation [2022-04-08 00:34:27,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27 WrapperNode [2022-04-08 00:34:27,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 00:34:27,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 00:34:27,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 00:34:27,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 00:34:27,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 00:34:27,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 00:34:27,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 00:34:27,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 00:34:27,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:34:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:34:27,248 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-08 00:34:27,251 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-08 00:34:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 00:34:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 00:34:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 00:34:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 00:34:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 00:34:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 00:34:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 00:34:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 00:34:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 00:34:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 00:34:27,346 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 00:34:27,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 00:34:27,458 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 00:34:27,463 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 00:34:27,463 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 00:34:27,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:34:27 BoogieIcfgContainer [2022-04-08 00:34:27,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 00:34:27,465 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 00:34:27,466 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 00:34:27,467 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 00:34:27,469 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:34:27" (1/1) ... [2022-04-08 00:34:27,470 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 00:34:27,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:34:27 BasicIcfg [2022-04-08 00:34:27,493 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 00:34:27,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 00:34:27,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 00:34:27,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 00:34:27,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:34:26" (1/4) ... [2022-04-08 00:34:27,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6d2725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:34:27, skipping insertion in model container [2022-04-08 00:34:27,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:34:27" (2/4) ... [2022-04-08 00:34:27,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6d2725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:34:27, skipping insertion in model container [2022-04-08 00:34:27,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:34:27" (3/4) ... [2022-04-08 00:34:27,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6d2725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:34:27, skipping insertion in model container [2022-04-08 00:34:27,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:34:27" (4/4) ... [2022-04-08 00:34:27,498 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.iqvasr [2022-04-08 00:34:27,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 00:34:27,502 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 00:34:27,562 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 00:34:27,573 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 00:34:27,573 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 00:34:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 00:34:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 00:34:27,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:34:27,602 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:34:27,602 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:34:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:34:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash -402483300, now seen corresponding path program 1 times [2022-04-08 00:34:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:34:27,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370687996] [2022-04-08 00:34:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:34:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 00:34:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:27,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-08 00:34:27,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 00:34:27,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 00:34:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 00:34:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:27,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 00:34:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:27,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 00:34:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:27,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 00:34:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:27,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 00:34:27,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-08 00:34:27,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 00:34:27,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 00:34:27,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 00:34:27,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {37#true} is VALID [2022-04-08 00:34:27,897 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 00:34:27,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {38#false} is VALID [2022-04-08 00:34:27,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 00:34:27,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,899 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,899 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 00:34:27,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,901 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,901 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 00:34:27,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-08 00:34:27,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,902 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 00:34:27,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {38#false} is VALID [2022-04-08 00:34:27,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} [113] L37-2-->L46-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} [116] L46-2-->L41-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,903 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} [121] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {38#false} is VALID [2022-04-08 00:34:27,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} [124] __VERIFIER_assertENTRY-->L19: 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] {38#false} is VALID [2022-04-08 00:34:27,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} [128] L19-->L20: 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[] {38#false} is VALID [2022-04-08 00:34:27,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 00:34:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:34:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:34:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370687996] [2022-04-08 00:34:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370687996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:34:27,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:34:27,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 00:34:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684767832] [2022-04-08 00:34:27,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:34:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 00:34:27,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:34:27,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:34:27,954 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-08 00:34:27,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 00:34:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:34:27,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 00:34:27,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 00:34:27,980 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:34:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:28,109 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-08 00:34:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 00:34:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 00:34:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:34:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:34:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-08 00:34:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:34:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-08 00:34:28,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-08 00:34:28,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:28,251 INFO L225 Difference]: With dead ends: 61 [2022-04-08 00:34:28,251 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 00:34:28,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-08 00:34:28,256 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:34:28,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:34:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 00:34:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 00:34:28,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:34:28,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:34:28,281 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:34:28,282 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:34:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:28,286 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 00:34:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 00:34:28,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:28,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:28,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 00:34:28,288 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 00:34:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:28,292 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 00:34:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 00:34:28,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:28,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:28,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:34:28,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:34:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:34:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-08 00:34:28,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-08 00:34:28,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:34:28,296 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-08 00:34:28,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:34:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 00:34:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 00:34:28,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:34:28,297 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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-08 00:34:28,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 00:34:28,298 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:34:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:34:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1131459816, now seen corresponding path program 1 times [2022-04-08 00:34:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:34:28,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147508393] [2022-04-08 00:34:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:34:28,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:34:28,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618973654] [2022-04-08 00:34:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:28,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:28,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:34:28,328 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-08 00:34:28,365 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-08 00:34:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:28,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 00:34:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:28,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:34:29,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-08 00:34:29,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {243#true} is VALID [2022-04-08 00:34:29,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {243#true} is VALID [2022-04-08 00:34:29,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:34:29,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:34:29,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:34:29,326 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {291#(not (= |assume_abort_if_not_#in~cond| 0))} {243#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {298#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-08 00:34:29,326 INFO L272 TraceCheckUtils]: 17: Hoare triple {298#(<= (mod main_~B~0 4294967296) 100)} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,327 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 100)} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {298#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-08 00:34:29,327 INFO L272 TraceCheckUtils]: 22: Hoare triple {298#(<= (mod main_~B~0 4294967296) 100)} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,328 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 100)} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {298#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-08 00:34:29,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {298#(<= (mod main_~B~0 4294967296) 100)} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-08 00:34:29,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-08 00:34:29,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-08 00:34:29,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-08 00:34:29,331 INFO L272 TraceCheckUtils]: 31: Hoare triple {339#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:34:29,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:34:29,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {244#false} is VALID [2022-04-08 00:34:29,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-08 00:34:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 00:34:29,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:34:29,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-08 00:34:29,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {244#false} is VALID [2022-04-08 00:34:29,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:34:29,621 INFO L272 TraceCheckUtils]: 31: Hoare triple {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:34:29,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 00:34:29,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 00:34:29,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 00:34:29,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {373#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 00:34:29,623 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {243#true} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,623 INFO L272 TraceCheckUtils]: 22: Hoare triple {243#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {243#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L272 TraceCheckUtils]: 17: Hoare triple {243#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {243#true} {243#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} [108] L16-->L16-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[] {243#true} is VALID [2022-04-08 00:34:29,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} [105] assume_abort_if_notENTRY-->L16: 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] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-08 00:34:29,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-08 00:34:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:34:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:34:29,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147508393] [2022-04-08 00:34:29,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:34:29,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618973654] [2022-04-08 00:34:29,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618973654] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 00:34:29,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 00:34:29,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 00:34:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388716616] [2022-04-08 00:34:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:34:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-08 00:34:29,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:34:29,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:29,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:29,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 00:34:29,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:34:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 00:34:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 00:34:29,650 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:32,028 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-08 00:34:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:32,129 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-08 00:34:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:34:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-08 00:34:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:34:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-08 00:34:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-08 00:34:32,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-08 00:34:32,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:32,179 INFO L225 Difference]: With dead ends: 41 [2022-04-08 00:34:32,179 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 00:34:32,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:34:32,180 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:34:32,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 00:34:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 00:34:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 00:34:32,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:34:32,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:32,201 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:32,201 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:32,204 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 00:34:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 00:34:32,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:32,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:32,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-08 00:34:32,205 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-08 00:34:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:32,207 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 00:34:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 00:34:32,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:32,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:32,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:34:32,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:34:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-08 00:34:32,210 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-08 00:34:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:34:32,210 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-08 00:34:32,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 00:34:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 00:34:32,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:34:32,224 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:34:32,251 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-08 00:34:32,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:32,442 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:34:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:34:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash -305154333, now seen corresponding path program 1 times [2022-04-08 00:34:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:34:32,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865044188] [2022-04-08 00:34:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:32,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:34:32,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:34:32,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977485922] [2022-04-08 00:34:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:32,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:34:32,468 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-08 00:34:32,502 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-08 00:34:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:32,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 00:34:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:32,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:34:33,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:33,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {653#true} is VALID [2022-04-08 00:34:33,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:33,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:33,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:33,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {653#true} is VALID [2022-04-08 00:34:33,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:33,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:34:33,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:34:33,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:34:33,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {653#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-08 00:34:33,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-08 00:34:33,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:33,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {653#true} is VALID [2022-04-08 00:34:33,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} [108] L16-->L16-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[] {653#true} is VALID [2022-04-08 00:34:33,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:33,429 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 100)} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-08 00:34:33,429 INFO L272 TraceCheckUtils]: 17: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:33,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {653#true} is VALID [2022-04-08 00:34:33,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} [108] L16-->L16-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[] {653#true} is VALID [2022-04-08 00:34:33,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:33,430 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 100)} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-08 00:34:33,430 INFO L272 TraceCheckUtils]: 22: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:33,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:34:33,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:34:33,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:34:33,432 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {690#(<= (mod main_~A~0 4294967296) 100)} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {739#(and (<= (mod main_~A~0 4294967296) 100) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-08 00:34:33,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {739#(and (<= (mod main_~A~0 4294967296) 100) (<= 1 (mod main_~B~0 4294967296)))} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 00:34:33,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 00:34:33,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 00:34:33,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 00:34:33,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 00:34:33,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 00:34:33,436 INFO L272 TraceCheckUtils]: 33: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:34:33,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:34:33,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {654#false} is VALID [2022-04-08 00:34:33,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#false} is VALID [2022-04-08 00:34:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 00:34:33,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:34:34,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#false} is VALID [2022-04-08 00:34:34,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {654#false} is VALID [2022-04-08 00:34:34,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:34:34,127 INFO L272 TraceCheckUtils]: 33: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:34:34,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-08 00:34:34,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-08 00:34:34,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-08 00:34:34,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-08 00:34:34,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-08 00:34:34,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {796#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-08 00:34:34,130 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {653#true} {653#true} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#true} [108] L16-->L16-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[] {653#true} is VALID [2022-04-08 00:34:34,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L272 TraceCheckUtils]: 22: Hoare triple {653#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {653#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} [108] L16-->L16-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[] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L272 TraceCheckUtils]: 17: Hoare triple {653#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {653#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} [108] L16-->L16-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[] {653#true} is VALID [2022-04-08 00:34:34,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {653#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#true} {653#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#true} [108] L16-->L16-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[] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} [105] assume_abort_if_notENTRY-->L16: 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] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {653#true} is VALID [2022-04-08 00:34:34,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#true} is VALID [2022-04-08 00:34:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:34:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:34:34,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865044188] [2022-04-08 00:34:34,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:34:34,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977485922] [2022-04-08 00:34:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977485922] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 00:34:34,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 00:34:34,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-08 00:34:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873338342] [2022-04-08 00:34:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:34:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-08 00:34:34,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:34:34,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:34,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:34,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 00:34:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:34:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 00:34:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:34:34,247 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:34,402 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 00:34:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 00:34:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-08 00:34:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:34:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 00:34:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 00:34:34,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 00:34:36,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:36,460 INFO L225 Difference]: With dead ends: 46 [2022-04-08 00:34:36,460 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 00:34:36,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 00:34:36,461 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:34:36,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-08 00:34:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 00:34:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 00:34:36,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:34:36,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 00:34:36,468 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 00:34:36,468 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 00:34:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:36,470 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 00:34:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 00:34:36,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:36,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:36,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-08 00:34:36,473 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-08 00:34:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:36,475 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 00:34:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 00:34:36,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:36,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:36,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:34:36,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:34:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 00:34:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-08 00:34:36,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-08 00:34:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:34:36,478 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-08 00:34:36,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:34:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 00:34:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 00:34:36,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:34:36,479 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 00:34:36,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 00:34:36,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 00:34:36,700 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:34:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:34:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1858557484, now seen corresponding path program 1 times [2022-04-08 00:34:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:34:36,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407384227] [2022-04-08 00:34:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:34:36,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:34:36,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506781212] [2022-04-08 00:34:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:36,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:36,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:34:36,728 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-08 00:34:36,729 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-08 00:34:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:36,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 00:34:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:36,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:34:36,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {1102#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1102#true} is VALID [2022-04-08 00:34:36,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1102#true} {1102#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {1102#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {1102#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1102#true} is VALID [2022-04-08 00:34:36,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {1102#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#true} [105] assume_abort_if_notENTRY-->L16: 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] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#true} [108] L16-->L16-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[] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1102#true} {1102#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L272 TraceCheckUtils]: 12: Hoare triple {1102#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#true} [105] assume_abort_if_notENTRY-->L16: 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] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#true} [108] L16-->L16-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[] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1102#true} {1102#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,846 INFO L272 TraceCheckUtils]: 17: Hoare triple {1102#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#true} [105] assume_abort_if_notENTRY-->L16: 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] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#true} [108] L16-->L16-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[] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1102#true} {1102#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L272 TraceCheckUtils]: 22: Hoare triple {1102#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {1102#true} [105] assume_abort_if_notENTRY-->L16: 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] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#true} [108] L16-->L16-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[] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {1102#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,847 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1102#true} {1102#true} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1102#true} is VALID [2022-04-08 00:34:36,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {1102#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 00:34:36,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#(= main_~B~0 main_~b~0)} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 00:34:36,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {1188#(= main_~B~0 main_~b~0)} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 00:34:36,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {1188#(= main_~B~0 main_~b~0)} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 00:34:36,849 INFO L272 TraceCheckUtils]: 31: Hoare triple {1188#(= main_~B~0 main_~b~0)} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1102#true} is VALID [2022-04-08 00:34:36,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {1102#true} [124] __VERIFIER_assertENTRY-->L19: 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] {1102#true} is VALID [2022-04-08 00:34:36,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {1102#true} [129] L19-->L19-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[] {1102#true} is VALID [2022-04-08 00:34:36,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {1102#true} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#true} is VALID [2022-04-08 00:34:36,850 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1102#true} {1188#(= main_~B~0 main_~b~0)} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 00:34:36,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {1188#(= main_~B~0 main_~b~0)} [126] L42-1-->L46: Formula: (let ((.cse0 (mod v_main_~b~0_8 4294967296))) (and (= v_main_~q~0_3 (* v_main_~q~0_4 2)) (= v_main_~b~0_7 (div .cse0 2)) (not (= .cse0 (mod v_main_~B~0_7 4294967296))))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_8} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1103#false} is VALID [2022-04-08 00:34:36,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {1103#false} [130] L46-->L46-2: Formula: (and (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_7 4294967296)) (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_6 (+ v_main_~r~0_7 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_7} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1103#false} is VALID [2022-04-08 00:34:36,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {1103#false} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1103#false} is VALID [2022-04-08 00:34:36,850 INFO L272 TraceCheckUtils]: 39: Hoare triple {1103#false} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1103#false} is VALID [2022-04-08 00:34:36,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {1103#false} [124] __VERIFIER_assertENTRY-->L19: 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] {1103#false} is VALID [2022-04-08 00:34:36,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {1103#false} [128] L19-->L20: 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[] {1103#false} is VALID [2022-04-08 00:34:36,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {1103#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1103#false} is VALID [2022-04-08 00:34:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:34:36,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:34:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:34:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407384227] [2022-04-08 00:34:36,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:34:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506781212] [2022-04-08 00:34:36,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506781212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:34:36,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:34:36,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 00:34:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097320341] [2022-04-08 00:34:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:34:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-08 00:34:36,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:34:36,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:34:36,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:36,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 00:34:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:34:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 00:34:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 00:34:36,875 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:34:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:36,933 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-08 00:34:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 00:34:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-08 00:34:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:34:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:34:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 00:34:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:34:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 00:34:36,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 00:34:36,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:36,976 INFO L225 Difference]: With dead ends: 55 [2022-04-08 00:34:36,976 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 00:34:36,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-08 00:34:36,977 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:34:36,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:34:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 00:34:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 00:34:36,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:34:36,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:36,982 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:36,982 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:36,984 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 00:34:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 00:34:36,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:36,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:36,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 00:34:36,984 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 00:34:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:36,986 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 00:34:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 00:34:36,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:36,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:36,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:34:36,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:34:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-08 00:34:36,988 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-08 00:34:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:34:36,988 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-08 00:34:36,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:34:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 00:34:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 00:34:36,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:34:36,989 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 00:34:37,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 00:34:37,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:37,206 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:34:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:34:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1983451131, now seen corresponding path program 1 times [2022-04-08 00:34:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:34:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272655423] [2022-04-08 00:34:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:34:37,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:34:37,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872928105] [2022-04-08 00:34:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:37,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:37,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:34:37,248 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-08 00:34:37,252 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-08 00:34:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:37,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 00:34:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:34:37,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:34:37,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {1436#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1436#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {1436#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {1436#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {1436#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1436#true} {1436#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1436#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {1436#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1436#true} {1436#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:37,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1436#true} {1436#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L272 TraceCheckUtils]: 22: Hoare triple {1436#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1436#true} {1436#true} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#true} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#true} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:37,467 INFO L272 TraceCheckUtils]: 33: Hoare triple {1436#true} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1436#true} is VALID [2022-04-08 00:34:37,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#true} [124] __VERIFIER_assertENTRY-->L19: 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] {1543#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:34:37,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {1543#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [129] L19-->L19-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[] {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:34:37,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:34:37,471 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} {1436#true} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 00:34:37,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [125] L42-1-->L41-1: Formula: (= (mod v_main_~b~0_6 4294967296) (mod v_main_~B~0_4 4294967296)) InVars {main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} OutVars{main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} AuxVars[] AssignedVars[] {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 00:34:37,471 INFO L272 TraceCheckUtils]: 39: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [121] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1561#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-08 00:34:37,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {1561#(= |__VERIFIER_assert_#in~cond| 1)} [124] __VERIFIER_assertENTRY-->L19: 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] {1565#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-08 00:34:37,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {1565#(= __VERIFIER_assert_~cond 1)} [128] L19-->L20: 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[] {1437#false} is VALID [2022-04-08 00:34:37,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {1437#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1437#false} is VALID [2022-04-08 00:34:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 00:34:37,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:34:38,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {1437#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1437#false} is VALID [2022-04-08 00:34:38,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {1575#(not (= __VERIFIER_assert_~cond 0))} [128] L19-->L20: 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[] {1437#false} is VALID [2022-04-08 00:34:38,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] __VERIFIER_assertENTRY-->L19: 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] {1575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:34:38,276 INFO L272 TraceCheckUtils]: 39: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [121] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:34:38,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [125] L42-1-->L41-1: Formula: (= (mod v_main_~b~0_6 4294967296) (mod v_main_~B~0_4 4294967296)) InVars {main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} OutVars{main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} AuxVars[] AssignedVars[] {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 00:34:38,277 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} {1436#true} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 00:34:38,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:34:38,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {1597#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [129] L19-->L19-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[] {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:34:38,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#true} [124] __VERIFIER_assertENTRY-->L19: 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] {1597#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:34:38,279 INFO L272 TraceCheckUtils]: 33: Hoare triple {1436#true} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#true} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#true} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1436#true} {1436#true} [139] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:38,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L272 TraceCheckUtils]: 22: Hoare triple {1436#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1436#true} {1436#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1436#true} {1436#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L272 TraceCheckUtils]: 12: Hoare triple {1436#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 100) 1 0)) InVars {main_~B~0=v_main_~B~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {1436#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1436#true} {1436#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#true} [108] L16-->L16-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[] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#true} [105] assume_abort_if_notENTRY-->L16: 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] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {1436#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 100) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {1436#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {1436#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1436#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1436#true} is VALID [2022-04-08 00:34:38,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {1436#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1436#true} is VALID [2022-04-08 00:34:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 00:34:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:34:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272655423] [2022-04-08 00:34:38,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:34:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872928105] [2022-04-08 00:34:38,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872928105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:34:38,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:34:38,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-08 00:34:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503231140] [2022-04-08 00:34:38,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:34:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-08 00:34:38,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:34:38,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 00:34:38,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:38,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 00:34:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:34:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 00:34:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 00:34:38,313 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 00:34:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:41,671 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 00:34:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 00:34:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-08 00:34:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:34:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 00:34:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 00:34:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 00:34:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 00:34:41,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 00:34:41,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:34:41,720 INFO L225 Difference]: With dead ends: 43 [2022-04-08 00:34:41,720 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 00:34:41,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-08 00:34:41,721 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 00:34:41,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 00:34:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 00:34:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 00:34:41,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:34:41,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:41,734 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:41,734 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:41,735 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 00:34:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 00:34:41,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:41,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:41,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 00:34:41,736 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 00:34:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:34:41,737 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 00:34:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 00:34:41,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:34:41,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:34:41,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:34:41,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:34:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:34:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-08 00:34:41,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-08 00:34:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:34:41,739 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-08 00:34:41,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 00:34:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 00:34:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 00:34:41,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:34:41,740 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 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] [2022-04-08 00:34:41,773 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-08 00:34:41,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:41,941 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:34:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:34:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash 270500047, now seen corresponding path program 1 times [2022-04-08 00:34:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:34:41,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078912684] [2022-04-08 00:34:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:34:41,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:34:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990425178] [2022-04-08 00:34:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:34:41,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:34:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:34:41,971 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-08 00:34:41,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process