/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 18:11:21,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 18:11:21,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 18:11:21,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 18:11:21,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 18:11:21,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 18:11:21,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 18:11:21,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 18:11:21,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 18:11:21,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 18:11:21,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 18:11:21,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 18:11:21,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 18:11:21,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 18:11:21,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 18:11:21,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 18:11:21,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 18:11:21,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 18:11:21,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 18:11:21,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 18:11:21,628 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 18:11:21,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 18:11:21,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 18:11:21,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 18:11:21,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 18:11:21,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 18:11:21,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 18:11:21,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 18:11:21,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 18:11:21,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 18:11:21,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 18:11:21,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 18:11:21,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 18:11:21,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 18:11:21,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 18:11:21,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 18:11:21,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 18:11:21,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 18:11:21,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 18:11:21,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 18:11:21,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 18:11:21,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 18:11:21,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 18:11:21,651 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 18:11:21,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 18:11:21,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 18:11:21,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 18:11:21,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 18:11:21,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 18:11:21,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 18:11:21,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 18:11:21,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 18:11:21,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 18:11:21,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 18:11:21,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:11:21,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 18:11:21,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 18:11:21,655 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 18:11:21,655 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 18:11:21,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 18:11:21,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 18:11:21,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 18:11:21,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 18:11:21,897 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 18:11:21,900 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-27 18:11:21,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee876fefa/6d0130909c8b43ec9d6814af6fbdb571/FLAG7f742c738 [2022-04-27 18:11:22,304 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 18:11:22,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-27 18:11:22,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee876fefa/6d0130909c8b43ec9d6814af6fbdb571/FLAG7f742c738 [2022-04-27 18:11:22,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee876fefa/6d0130909c8b43ec9d6814af6fbdb571 [2022-04-27 18:11:22,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 18:11:22,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 18:11:22,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 18:11:22,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 18:11:22,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 18:11:22,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:11:22" (1/1) ... [2022-04-27 18:11:22,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e038e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:22, skipping insertion in model container [2022-04-27 18:11:22,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:11:22" (1/1) ... [2022-04-27 18:11:22,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 18:11:22,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 18:11:22,965 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-27 18:11:22,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:11:22,991 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 18:11:23,000 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-27 18:11:23,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:11:23,027 INFO L208 MainTranslator]: Completed translation [2022-04-27 18:11:23,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23 WrapperNode [2022-04-27 18:11:23,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 18:11:23,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 18:11:23,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 18:11:23,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 18:11:23,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 18:11:23,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 18:11:23,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 18:11:23,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 18:11:23,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:11:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:11:23,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 18:11:23,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 18:11:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 18:11:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 18:11:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 18:11:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 18:11:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 18:11:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 18:11:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 18:11:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 18:11:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 18:11:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 18:11:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 18:11:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 18:11:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 18:11:23,181 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 18:11:23,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 18:11:23,309 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 18:11:23,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 18:11:23,315 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 18:11:23,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:11:23 BoogieIcfgContainer [2022-04-27 18:11:23,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 18:11:23,317 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 18:11:23,317 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 18:11:23,318 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 18:11:23,320 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:11:23" (1/1) ... [2022-04-27 18:11:23,322 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 18:11:23,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:11:23 BasicIcfg [2022-04-27 18:11:23,360 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 18:11:23,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 18:11:23,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 18:11:23,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 18:11:23,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 06:11:22" (1/4) ... [2022-04-27 18:11:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d527dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:11:23, skipping insertion in model container [2022-04-27 18:11:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:11:23" (2/4) ... [2022-04-27 18:11:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d527dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:11:23, skipping insertion in model container [2022-04-27 18:11:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:11:23" (3/4) ... [2022-04-27 18:11:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d527dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:11:23, skipping insertion in model container [2022-04-27 18:11:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:11:23" (4/4) ... [2022-04-27 18:11:23,366 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.iJordan [2022-04-27 18:11:23,376 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 18:11:23,377 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 18:11:23,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 18:11:23,424 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7232068e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e6b38ff [2022-04-27 18:11:23,425 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 18:11:23,453 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-27 18:11:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 18:11:23,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:11:23,459 INFO L195 NwaCegarLoop]: 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-27 18:11:23,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:11:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:11:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash -402483300, now seen corresponding path program 1 times [2022-04-27 18:11:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:11:23,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432199378] [2022-04-27 18:11:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:11:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 18:11:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:23,689 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-27 18:11:23,690 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-27 18:11:23,690 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-27 18:11:23,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 18:11:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:23,700 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-27 18:11:23,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,701 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-27 18:11:23,702 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-27 18:11:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 18:11:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:23,710 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-27 18:11:23,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,711 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-27 18:11:23,711 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-27 18:11:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 18:11:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:23,719 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-27 18:11:23,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,720 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-27 18:11:23,721 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-27 18:11:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 18:11:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:23,728 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-27 18:11:23,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,729 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-27 18:11:23,730 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-27 18:11:23,731 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-27 18:11:23,731 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-27 18:11:23,732 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-27 18:11:23,732 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-27 18:11:23,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-27 18:11:23,732 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-27 18:11:23,733 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-27 18:11:23,733 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-27 18:11:23,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,734 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-27 18:11:23,734 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-27 18:11:23,734 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-27 18:11:23,735 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-27 18:11:23,735 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-27 18:11:23,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,736 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-27 18:11:23,736 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-27 18:11:23,736 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-27 18:11:23,737 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-27 18:11:23,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,738 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-27 18:11:23,738 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-27 18:11:23,738 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-27 18:11:23,738 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-27 18:11:23,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 18:11:23,739 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-27 18:11:23,740 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-27 18:11:23,740 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-27 18:11:23,740 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-27 18:11:23,740 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-27 18:11:23,741 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-27 18:11:23,741 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-27 18:11:23,741 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-27 18:11:23,742 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-27 18:11:23,742 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-27 18:11:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:11:23,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432199378] [2022-04-27 18:11:23,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432199378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:11:23,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:11:23,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 18:11:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679504758] [2022-04-27 18:11:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:11:23,751 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-27 18:11:23,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:11:23,755 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-27 18:11:23,807 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-27 18:11:23,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 18:11:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:11:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 18:11:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:11:23,833 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-27 18:11:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:23,953 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 18:11:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 18:11:23,954 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-27 18:11:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:11:23,955 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-27 18:11:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 18:11:23,963 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-27 18:11:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 18:11:23,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-27 18:11:24,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:11:24,033 INFO L225 Difference]: With dead ends: 34 [2022-04-27 18:11:24,033 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 18:11:24,035 INFO L412 NwaCegarLoop]: 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-27 18:11:24,040 INFO L413 NwaCegarLoop]: 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-27 18:11:24,042 INFO L414 NwaCegarLoop]: 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-27 18:11:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 18:11:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 18:11:24,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:11:24,067 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-27 18:11:24,068 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-27 18:11:24,069 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-27 18:11:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:24,079 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 18:11:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 18:11:24,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:24,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:24,081 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-27 18:11:24,082 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-27 18:11:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:24,087 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 18:11:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 18:11:24,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:24,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:24,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:11:24,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:11:24,089 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-27 18:11:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-27 18:11:24,091 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-27 18:11:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:11:24,092 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-27 18:11:24,092 INFO L496 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-27 18:11:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 18:11:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 18:11:24,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:11:24,094 INFO L195 NwaCegarLoop]: 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-27 18:11:24,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 18:11:24,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:11:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:11:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1131459816, now seen corresponding path program 1 times [2022-04-27 18:11:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:11:24,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321627524] [2022-04-27 18:11:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:11:24,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:11:24,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479629309] [2022-04-27 18:11:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:24,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:11:24,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:11:24,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:11:24,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 18:11:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:24,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 18:11:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:24,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:11:25,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {182#true} {182#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] {182#true} is VALID [2022-04-27 18:11:25,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#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] {226#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:11:25,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {226#(= 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[] {230#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:11:25,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {230#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:11:25,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {230#(not (= |assume_abort_if_not_#in~cond| 0))} {182#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] {237#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 18:11:25,291 INFO L272 TraceCheckUtils]: 17: Hoare triple {237#(<= (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] {182#true} is VALID [2022-04-27 18:11:25,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {182#true} {237#(<= (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] {237#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 18:11:25,292 INFO L272 TraceCheckUtils]: 22: Hoare triple {237#(<= (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] {182#true} is VALID [2022-04-27 18:11:25,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,293 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {182#true} {237#(<= (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] {237#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 18:11:25,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {237#(<= (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] {271#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-27 18:11:25,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {271#(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[] {271#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-27 18:11:25,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {271#(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[] {278#(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-27 18:11:25,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {278#(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[] {278#(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-27 18:11:25,296 INFO L272 TraceCheckUtils]: 31: Hoare triple {278#(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] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:11:25,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {285#(<= 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] {289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:11:25,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {289#(<= 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[] {183#false} is VALID [2022-04-27 18:11:25,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {183#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 18:11:25,300 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-27 18:11:25,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:11:25,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {183#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 18:11:25,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {289#(<= 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[] {183#false} is VALID [2022-04-27 18:11:25,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {285#(<= 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] {289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:11:25,697 INFO L272 TraceCheckUtils]: 31: Hoare triple {305#(= (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] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:11:25,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {305#(= (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[] {305#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 18:11:25,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {312#(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[] {305#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 18:11:25,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {312#(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[] {312#(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-27 18:11:25,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {182#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] {312#(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-27 18:11:25,701 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {182#true} {182#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] {182#true} is VALID [2022-04-27 18:11:25,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,702 INFO L272 TraceCheckUtils]: 22: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {182#true} {182#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] {182#true} is VALID [2022-04-27 18:11:25,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L272 TraceCheckUtils]: 17: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {182#true} {182#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] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {182#true} {182#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] {182#true} is VALID [2022-04-27 18:11:25,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#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[] {182#true} is VALID [2022-04-27 18:11:25,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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] {182#true} is VALID [2022-04-27 18:11:25,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 18:11:25,705 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-27 18:11:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:11:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321627524] [2022-04-27 18:11:25,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:11:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479629309] [2022-04-27 18:11:25,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479629309] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 18:11:25,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 18:11:25,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 18:11:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781465138] [2022-04-27 18:11:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:11:25,720 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-27 18:11:25,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:11:25,720 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-27 18:11:25,739 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-27 18:11:25,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 18:11:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:11:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 18:11:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 18:11:25,740 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-27 18:11:27,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:11:30,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:11:32,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:11:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:32,210 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-27 18:11:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 18:11:32,210 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-27 18:11:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:11:32,211 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-27 18:11:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 18:11:32,213 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-27 18:11:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 18:11:32,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 18:11:32,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:11:32,261 INFO L225 Difference]: With dead ends: 39 [2022-04-27 18:11:32,261 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 18:11:32,261 INFO L412 NwaCegarLoop]: 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-27 18:11:32,262 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-27 18:11:32,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-04-27 18:11:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 18:11:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 18:11:32,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:11:32,266 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-27 18:11:32,266 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-27 18:11:32,267 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-27 18:11:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:32,269 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 18:11:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 18:11:32,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:32,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:32,273 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-27 18:11:32,273 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-27 18:11:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:32,275 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 18:11:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 18:11:32,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:32,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:32,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:11:32,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:11:32,276 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-27 18:11:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-27 18:11:32,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-27 18:11:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:11:32,278 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-27 18:11:32,278 INFO L496 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-27 18:11:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 18:11:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 18:11:32,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:11:32,279 INFO L195 NwaCegarLoop]: 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-27 18:11:32,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 18:11:32,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:11:32,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:11:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:11:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -305154333, now seen corresponding path program 1 times [2022-04-27 18:11:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:11:32,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783037090] [2022-04-27 18:11:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:11:32,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:11:32,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486808044] [2022-04-27 18:11:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:11:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:11:32,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:11:32,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 18:11:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:32,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 18:11:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:32,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:11:33,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {557#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:33,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:33,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {557#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:33,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:33,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:33,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:33,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:33,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#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] {583#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:11:33,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(= 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[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:11:33,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:11:33,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#(not (= |assume_abort_if_not_#in~cond| 0))} {557#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] {594#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 18:11:33,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(<= (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] {594#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 18:11:33,524 INFO L272 TraceCheckUtils]: 12: Hoare triple {594#(<= (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] {557#true} is VALID [2022-04-27 18:11:33,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:33,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {557#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[] {557#true} is VALID [2022-04-27 18:11:33,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:33,525 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {557#true} {594#(<= (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] {594#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 18:11:33,526 INFO L272 TraceCheckUtils]: 17: Hoare triple {594#(<= (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] {557#true} is VALID [2022-04-27 18:11:33,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:33,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {557#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[] {557#true} is VALID [2022-04-27 18:11:33,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:33,527 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {557#true} {594#(<= (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] {594#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 18:11:33,527 INFO L272 TraceCheckUtils]: 22: Hoare triple {594#(<= (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] {557#true} is VALID [2022-04-27 18:11:33,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {557#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] {583#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:11:33,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {583#(= 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[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:11:33,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:11:33,530 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#(not (= |assume_abort_if_not_#in~cond| 0))} {594#(<= (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] {643#(and (<= (mod main_~A~0 4294967296) 100) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 18:11:33,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(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] {647#(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-27 18:11:33,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {647#(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[] {647#(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-27 18:11:33,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {647#(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] {654#(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-27 18:11:33,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {654#(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[] {654#(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-27 18:11:33,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {654#(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[] {654#(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-27 18:11:33,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {654#(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[] {654#(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-27 18:11:33,540 INFO L272 TraceCheckUtils]: 33: Hoare triple {654#(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] {667#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:11:33,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {667#(<= 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] {671#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:11:33,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {671#(<= 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[] {558#false} is VALID [2022-04-27 18:11:33,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {558#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {558#false} is VALID [2022-04-27 18:11:33,541 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-27 18:11:33,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:11:34,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {558#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {558#false} is VALID [2022-04-27 18:11:34,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {671#(<= 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[] {558#false} is VALID [2022-04-27 18:11:34,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {667#(<= 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] {671#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:11:34,170 INFO L272 TraceCheckUtils]: 33: Hoare triple {687#(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] {667#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:11:34,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(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[] {687#(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-27 18:11:34,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {687#(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[] {687#(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-27 18:11:34,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {687#(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[] {687#(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-27 18:11:34,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {700#(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] {687#(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-27 18:11:34,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {700#(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[] {700#(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-27 18:11:34,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {557#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] {700#(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-27 18:11:34,173 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {557#true} {557#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] {557#true} is VALID [2022-04-27 18:11:34,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {557#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[] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L272 TraceCheckUtils]: 22: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {557#true} {557#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] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {557#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[] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,174 INFO L272 TraceCheckUtils]: 17: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {557#true} {557#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] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {557#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[] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L272 TraceCheckUtils]: 12: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {557#true} {557#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] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {557#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[] {557#true} is VALID [2022-04-27 18:11:34,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {557#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {557#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] {557#true} is VALID [2022-04-27 18:11:34,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {557#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-27 18:11:34,176 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-27 18:11:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:11:34,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783037090] [2022-04-27 18:11:34,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:11:34,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486808044] [2022-04-27 18:11:34,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486808044] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 18:11:34,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 18:11:34,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-27 18:11:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521988881] [2022-04-27 18:11:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:11:34,178 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-27 18:11:34,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:11:34,178 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-27 18:11:34,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:11:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 18:11:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:11:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 18:11:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 18:11:34,651 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-27 18:11:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:35,568 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 18:11:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 18:11:35,568 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-27 18:11:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:11:35,568 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-27 18:11:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 18:11:35,570 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-27 18:11:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 18:11:35,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 18:11:37,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 18:11:37,627 INFO L225 Difference]: With dead ends: 44 [2022-04-27 18:11:37,627 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 18:11:37,628 INFO L412 NwaCegarLoop]: 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-27 18:11:37,628 INFO L413 NwaCegarLoop]: 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, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:11:37,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-04-27 18:11:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 18:11:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 18:11:37,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:11:37,632 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-27 18:11:37,632 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-27 18:11:37,632 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-27 18:11:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:37,634 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 18:11:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 18:11:37,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:37,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:37,635 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-27 18:11:37,635 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-27 18:11:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:37,637 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 18:11:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 18:11:37,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:37,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:37,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:11:37,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:11:37,643 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-27 18:11:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 18:11:37,648 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-27 18:11:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:11:37,649 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 18:11:37,649 INFO L496 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-27 18:11:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 18:11:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 18:11:37,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:11:37,650 INFO L195 NwaCegarLoop]: 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-27 18:11:37,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 18:11:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 18:11:37,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:11:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:11:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1858557484, now seen corresponding path program 1 times [2022-04-27 18:11:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:11:37,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301395150] [2022-04-27 18:11:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:11:37,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:11:37,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223692989] [2022-04-27 18:11:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:37,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:11:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:11:37,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:11:37,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 18:11:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:37,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 18:11:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:37,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:11:38,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {968#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {968#true} {968#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {968#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#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[] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {968#true} {968#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] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#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[] {968#true} is VALID [2022-04-27 18:11:38,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,054 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {968#true} {968#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] {968#true} is VALID [2022-04-27 18:11:38,054 INFO L272 TraceCheckUtils]: 17: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {968#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[] {968#true} is VALID [2022-04-27 18:11:38,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,055 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {968#true} {968#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] {968#true} is VALID [2022-04-27 18:11:38,055 INFO L272 TraceCheckUtils]: 22: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {968#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[] {968#true} is VALID [2022-04-27 18:11:38,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,055 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {968#true} {968#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] {968#true} is VALID [2022-04-27 18:11:38,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {968#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] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 18:11:38,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {1054#(= main_~B~0 main_~b~0)} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 18:11:38,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {1054#(= 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[] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 18:11:38,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {1054#(= main_~B~0 main_~b~0)} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 18:11:38,057 INFO L272 TraceCheckUtils]: 31: Hoare triple {1054#(= 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] {968#true} is VALID [2022-04-27 18:11:38,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {968#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] {968#true} is VALID [2022-04-27 18:11:38,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {968#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[] {968#true} is VALID [2022-04-27 18:11:38,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {968#true} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-27 18:11:38,058 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {968#true} {1054#(= 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] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 18:11:38,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {1054#(= 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] {969#false} is VALID [2022-04-27 18:11:38,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#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] {969#false} is VALID [2022-04-27 18:11:38,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#false} is VALID [2022-04-27 18:11:38,059 INFO L272 TraceCheckUtils]: 39: Hoare triple {969#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] {969#false} is VALID [2022-04-27 18:11:38,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#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] {969#false} is VALID [2022-04-27 18:11:38,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#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[] {969#false} is VALID [2022-04-27 18:11:38,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#false} is VALID [2022-04-27 18:11:38,060 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-27 18:11:38,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 18:11:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:11:38,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301395150] [2022-04-27 18:11:38,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:11:38,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223692989] [2022-04-27 18:11:38,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223692989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:11:38,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:11:38,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 18:11:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969295373] [2022-04-27 18:11:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:11:38,061 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-27 18:11:38,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:11:38,062 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-27 18:11:38,084 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-27 18:11:38,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 18:11:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:11:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 18:11:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:11:38,085 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-27 18:11:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:38,166 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 18:11:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 18:11:38,166 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-27 18:11:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:11:38,167 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-27 18:11:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 18:11:38,168 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-27 18:11:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 18:11:38,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-27 18:11:38,199 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-27 18:11:38,201 INFO L225 Difference]: With dead ends: 44 [2022-04-27 18:11:38,201 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 18:11:38,201 INFO L412 NwaCegarLoop]: 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-27 18:11:38,202 INFO L413 NwaCegarLoop]: 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-27 18:11:38,202 INFO L414 NwaCegarLoop]: 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-27 18:11:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 18:11:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 18:11:38,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:11:38,205 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-27 18:11:38,206 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-27 18:11:38,206 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-27 18:11:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:38,208 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 18:11:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 18:11:38,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:38,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:38,209 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-27 18:11:38,209 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-27 18:11:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:38,211 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 18:11:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 18:11:38,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:38,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:38,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:11:38,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:11:38,212 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-27 18:11:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-27 18:11:38,213 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-27 18:11:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:11:38,214 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-27 18:11:38,214 INFO L496 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-27 18:11:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 18:11:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 18:11:38,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:11:38,215 INFO L195 NwaCegarLoop]: 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-27 18:11:38,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 18:11:38,425 WARN L477 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-27 18:11:38,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:11:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:11:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1983451131, now seen corresponding path program 1 times [2022-04-27 18:11:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:11:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116285270] [2022-04-27 18:11:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:11:38,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:11:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500752636] [2022-04-27 18:11:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:11:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:11:38,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:11:38,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 18:11:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:38,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 18:11:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:11:38,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:11:38,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L272 TraceCheckUtils]: 12: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,756 INFO L272 TraceCheckUtils]: 17: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L272 TraceCheckUtils]: 22: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:38,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {1254#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:38,758 INFO L272 TraceCheckUtils]: 33: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:38,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {1254#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] {1361#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:11:38,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {1361#(= |__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[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:11:38,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:11:38,761 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} {1254#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] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 18:11:38,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {1372#(= (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[] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 18:11:38,762 INFO L272 TraceCheckUtils]: 39: Hoare triple {1372#(= (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] {1379#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 18:11:38,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {1379#(= |__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] {1383#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 18:11:38,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {1383#(= __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[] {1255#false} is VALID [2022-04-27 18:11:38,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {1255#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1255#false} is VALID [2022-04-27 18:11:38,763 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-27 18:11:38,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:11:40,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {1255#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1255#false} is VALID [2022-04-27 18:11:40,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {1393#(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[] {1255#false} is VALID [2022-04-27 18:11:40,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {1365#(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] {1393#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 18:11:40,092 INFO L272 TraceCheckUtils]: 39: Hoare triple {1372#(= (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] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:11:40,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {1372#(= (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[] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 18:11:40,093 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} {1254#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] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 18:11:40,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:11:40,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {1415#(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[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {1254#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] {1415#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 18:11:40,094 INFO L272 TraceCheckUtils]: 33: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {1254#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L272 TraceCheckUtils]: 22: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L272 TraceCheckUtils]: 17: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L272 TraceCheckUtils]: 12: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1254#true} {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#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[] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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] {1254#true} is VALID [2022-04-27 18:11:40,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-27 18:11:40,097 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-27 18:11:40,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:11:40,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116285270] [2022-04-27 18:11:40,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:11:40,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500752636] [2022-04-27 18:11:40,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500752636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 18:11:40,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 18:11:40,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 18:11:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519355518] [2022-04-27 18:11:40,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 18:11:40,098 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-27 18:11:40,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:11:40,099 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-27 18:11:40,149 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-27 18:11:40,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 18:11:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:11:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 18:11:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 18:11:40,150 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-27 18:11:42,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:11:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:43,133 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 18:11:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 18:11:43,134 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-27 18:11:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:11:43,134 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-27 18:11:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 18:11:43,135 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-27 18:11:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 18:11:43,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-27 18:11:43,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:11:43,178 INFO L225 Difference]: With dead ends: 41 [2022-04-27 18:11:43,178 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 18:11:43,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 18:11:43,179 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 18:11:43,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 18:11:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 18:11:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 18:11:43,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:11:43,182 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-27 18:11:43,182 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-27 18:11:43,182 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-27 18:11:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:43,184 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 18:11:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 18:11:43,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:43,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:43,200 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-27 18:11:43,200 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-27 18:11:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:11:43,201 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 18:11:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 18:11:43,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:11:43,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:11:43,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:11:43,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:11:43,202 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-27 18:11:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-27 18:11:43,203 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-27 18:11:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:11:43,203 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-27 18:11:43,204 INFO L496 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-27 18:11:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 18:11:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 18:11:43,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:11:43,204 INFO L195 NwaCegarLoop]: 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-27 18:11:43,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 18:11:43,405 WARN L477 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-27 18:11:43,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:11:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:11:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 270500047, now seen corresponding path program 1 times [2022-04-27 18:11:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:11:43,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769081108] [2022-04-27 18:11:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:11:43,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:11:43,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029646830] [2022-04-27 18:11:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:11:43,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:11:43,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:11:43,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:11:43,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process