/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 02:22:30,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:22:30,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:22:30,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:22:30,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:22:30,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:22:30,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:22:30,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:22:30,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:22:30,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:22:30,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:22:30,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:22:30,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:22:30,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:22:30,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:22:30,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:22:30,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:22:30,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:22:30,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:22:30,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:22:30,260 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:22:30,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:22:30,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:22:30,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:22:30,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:22:30,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:22:30,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:22:30,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:22:30,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:22:30,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:22:30,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:22:30,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:22:30,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:22:30,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:22:30,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:22:30,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:22:30,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:22:30,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:22:30,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:22:30,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:22:30,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:22:30,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:22:30,283 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:22:30,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:22:30,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:22:30,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:22:30,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:22:30,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:22:30,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:22:30,311 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:22:30,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:22:30,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:22:30,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:22:30,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:22:30,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:22:30,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:22:30,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:22:30,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:22:30,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:22:30,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:22:30,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:22:30,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:22:30,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:22:30,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:22:30,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:22:30,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:22:30,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:22:30,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:22:30,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:22:30,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:22:30,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:22:30,315 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:22:30,315 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 02:22:30,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:22:30,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:22:30,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:22:30,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:22:30,555 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:22:30,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i [2022-04-15 02:22:30,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d4fe576/3676a6882d814f099abac7ce614e0ed4/FLAG9e6b006b3 [2022-04-15 02:22:31,066 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:22:31,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound100.i [2022-04-15 02:22:31,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d4fe576/3676a6882d814f099abac7ce614e0ed4/FLAG9e6b006b3 [2022-04-15 02:22:31,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d4fe576/3676a6882d814f099abac7ce614e0ed4 [2022-04-15 02:22:31,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:22:31,120 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:22:31,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:22:31,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:22:31,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:22:31,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecdad70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31, skipping insertion in model container [2022-04-15 02:22:31,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:22:31,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:22:31,299 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/divbin2_valuebound100.i[951,964] [2022-04-15 02:22:31,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:22:31,338 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:22:31,349 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/divbin2_valuebound100.i[951,964] [2022-04-15 02:22:31,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:22:31,371 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:22:31,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31 WrapperNode [2022-04-15 02:22:31,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:22:31,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:22:31,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:22:31,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:22:31,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:22:31,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:22:31,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:22:31,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:22:31,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:22:31,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:22:31,436 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-15 02:22:31,438 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-15 02:22:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:22:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:22:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:22:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:22:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:22:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 02:22:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:22:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:22:31,543 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:22:31,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:22:31,701 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:22:31,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:22:31,709 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 02:22:31,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:22:31 BoogieIcfgContainer [2022-04-15 02:22:31,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:22:31,712 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:22:31,712 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:22:31,713 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:22:31,716 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:22:31" (1/1) ... [2022-04-15 02:22:31,718 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:22:31,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:22:31 BasicIcfg [2022-04-15 02:22:31,762 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:22:31,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:22:31,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:22:31,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:22:31,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:22:31" (1/4) ... [2022-04-15 02:22:31,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109fd761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:22:31, skipping insertion in model container [2022-04-15 02:22:31,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:22:31" (2/4) ... [2022-04-15 02:22:31,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109fd761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:22:31, skipping insertion in model container [2022-04-15 02:22:31,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:22:31" (3/4) ... [2022-04-15 02:22:31,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109fd761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:22:31, skipping insertion in model container [2022-04-15 02:22:31,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:22:31" (4/4) ... [2022-04-15 02:22:31,777 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound100.iqvasr [2022-04-15 02:22:31,782 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:22:31,782 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:22:31,828 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:22:31,841 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 02:22:31,842 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:22:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 02:22:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 02:22:31,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:22:31,895 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:22:31,895 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:22:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:22:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 483266332, now seen corresponding path program 1 times [2022-04-15 02:22:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:22:31,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605907303] [2022-04-15 02:22:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:22:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:22:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:32,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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) 10) (= (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] {33#true} is VALID [2022-04-15 02:22:32,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 02:22:32,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 02:22:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:22:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:32,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [95] 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] {33#true} is VALID [2022-04-15 02:22:32,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [99] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [122] 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] {34#false} is VALID [2022-04-15 02:22:32,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:22:32,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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) 10) (= (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] {33#true} is VALID [2022-04-15 02:22:32,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 02:22:32,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 02:22:32,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 02:22:32,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {33#true} is VALID [2022-04-15 02:22:32,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [93] 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] {33#true} is VALID [2022-04-15 02:22:32,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [95] 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] {33#true} is VALID [2022-04-15 02:22:32,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [99] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,206 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [122] 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] {34#false} is VALID [2022-04-15 02:22:32,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {34#false} is VALID [2022-04-15 02:22:32,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [96] L34-2-->L43-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} [101] L43-2-->L38-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,208 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} [107] L38-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] {34#false} is VALID [2022-04-15 02:22:32,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [110] __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] {34#false} is VALID [2022-04-15 02:22:32,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [114] 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[] {34#false} is VALID [2022-04-15 02:22:32,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 02:22:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:22:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:22:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605907303] [2022-04-15 02:22:32,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605907303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:22:32,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:22:32,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:22:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231358574] [2022-04-15 02:22:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:22:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 02:22:32,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:22:32,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:32,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:22:32,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:22:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:22:32,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:22:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:22:32,299 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:32,409 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 02:22:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:22:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 02:22:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:22:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 02:22:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 02:22:32,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 02:22:32,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:22:32,540 INFO L225 Difference]: With dead ends: 51 [2022-04-15 02:22:32,540 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 02:22:32,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:22:32,548 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:22:32,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:22:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 02:22:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 02:22:32,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:22:32,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:22:32,581 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:22:32,581 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:22:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:32,585 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 02:22:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 02:22:32,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:32,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:32,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 02:22:32,586 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 02:22:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:32,589 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 02:22:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 02:22:32,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:32,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:32,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:22:32,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:22:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 02:22:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 02:22:32,594 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-15 02:22:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:22:32,594 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 02:22:32,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 02:22:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 02:22:32,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:22:32,595 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:22:32,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:22:32,596 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:22:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:22:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2138426952, now seen corresponding path program 1 times [2022-04-15 02:22:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:22:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421029776] [2022-04-15 02:22:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:22:32,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:22:32,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1506572697] [2022-04-15 02:22:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:32,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:22:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:22:32,623 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-15 02:22:32,629 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-15 02:22:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:32,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 02:22:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:32,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:22:33,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-15 02:22:33,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} [89] 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) 10) (= (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] {195#true} is VALID [2022-04-15 02:22:33,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-15 02:22:33,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-15 02:22:33,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-15 02:22:33,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {195#true} is VALID [2022-04-15 02:22:33,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {195#true} [93] 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] {195#true} is VALID [2022-04-15 02:22:33,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#true} [95] 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] {195#true} is VALID [2022-04-15 02:22:33,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#true} [100] 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[] {195#true} is VALID [2022-04-15 02:22:33,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-15 02:22:33,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {195#true} {195#true} [122] 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] {195#true} is VALID [2022-04-15 02:22:33,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:33,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:33,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:33,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:33,182 INFO L272 TraceCheckUtils]: 15: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [108] L39-->__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] {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:22:33,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __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] {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:22:33,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} [114] 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[] {196#false} is VALID [2022-04-15 02:22:33,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {196#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#false} is VALID [2022-04-15 02:22:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:22:33,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:22:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:22:33,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421029776] [2022-04-15 02:22:33,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:22:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506572697] [2022-04-15 02:22:33,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506572697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:22:33,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:22:33,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 02:22:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426516925] [2022-04-15 02:22:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:22:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-15 02:22:33,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:22:33,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:33,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:22:33,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 02:22:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:22:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 02:22:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:22:33,209 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:33,457 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 02:22:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:22:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-15 02:22:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:22:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 02:22:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 02:22:33,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 02:22:33,511 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-15 02:22:33,512 INFO L225 Difference]: With dead ends: 37 [2022-04-15 02:22:33,513 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 02:22:33,513 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 02:22:33,514 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:22:33,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:22:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 02:22:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 02:22:33,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:22:33,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:33,527 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:33,527 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:33,530 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 02:22:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 02:22:33,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:33,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:33,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 02:22:33,532 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 02:22:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:33,534 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 02:22:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 02:22:33,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:33,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:33,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:22:33,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:22:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 02:22:33,538 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-15 02:22:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:22:33,538 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 02:22:33,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 02:22:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 02:22:33,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:22:33,540 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:22:33,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 02:22:33,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:22:33,756 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:22:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:22:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash -554838191, now seen corresponding path program 1 times [2022-04-15 02:22:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:22:33,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904886836] [2022-04-15 02:22:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:22:33,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:22:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898101983] [2022-04-15 02:22:33,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:33,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:22:33,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:22:33,779 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-15 02:22:33,795 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-15 02:22:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:33,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 02:22:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:33,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:22:34,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 02:22:34,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [89] 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) 10) (= (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] {425#true} is VALID [2022-04-15 02:22:34,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 02:22:34,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 02:22:34,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 02:22:34,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {425#true} is VALID [2022-04-15 02:22:34,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} [93] 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] {425#true} is VALID [2022-04-15 02:22:34,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#true} [95] 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] {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:22:34,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [100] 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[] {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:22:34,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:22:34,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {455#(not (= |assume_abort_if_not_#in~cond| 0))} {425#true} [122] 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] {462#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-15 02:22:34,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= (mod main_~A~0 4294967296) 100)} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:34,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:34,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:34,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:34,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:34,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:34,235 INFO L272 TraceCheckUtils]: 17: Hoare triple {466#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [108] L39-->__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] {485#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:22:34,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {485#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __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] {489#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:22:34,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {489#(<= 1 __VERIFIER_assert_~cond)} [114] 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[] {426#false} is VALID [2022-04-15 02:22:34,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-15 02:22:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 02:22:34,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:22:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:22:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904886836] [2022-04-15 02:22:34,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:22:34,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898101983] [2022-04-15 02:22:34,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898101983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:22:34,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:22:34,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 02:22:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999417762] [2022-04-15 02:22:34,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:22:34,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 02:22:34,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:22:34,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:34,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:22:34,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 02:22:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:22:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 02:22:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 02:22:34,263 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:34,589 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 02:22:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:22:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 02:22:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:22:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 02:22:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 02:22:34,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 02:22:34,637 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-15 02:22:34,638 INFO L225 Difference]: With dead ends: 45 [2022-04-15 02:22:34,638 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 02:22:34,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 02:22:34,640 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:22:34,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:22:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 02:22:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-15 02:22:34,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:22:34,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:34,651 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:34,651 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:34,654 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 02:22:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 02:22:34,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:34,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:34,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-15 02:22:34,656 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-15 02:22:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:34,658 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 02:22:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 02:22:34,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:34,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:34,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:22:34,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:22:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 02:22:34,661 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-15 02:22:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:22:34,662 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 02:22:34,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:22:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 02:22:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 02:22:34,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:22:34,663 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:22:34,685 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-15 02:22:34,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 02:22:34,880 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:22:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:22:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1600606598, now seen corresponding path program 1 times [2022-04-15 02:22:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:22:34,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896190993] [2022-04-15 02:22:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:34,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:22:34,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:22:34,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434747944] [2022-04-15 02:22:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:22:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:22:34,900 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-15 02:22:34,907 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-15 02:22:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:34,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 02:22:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:34,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:22:35,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-15 02:22:35,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#true} [89] 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) 10) (= (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] {689#true} is VALID [2022-04-15 02:22:35,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-15 02:22:35,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-15 02:22:35,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-15 02:22:35,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {689#true} is VALID [2022-04-15 02:22:35,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} [93] 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] {689#true} is VALID [2022-04-15 02:22:35,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} [95] 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] {689#true} is VALID [2022-04-15 02:22:35,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} [100] 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[] {689#true} is VALID [2022-04-15 02:22:35,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-15 02:22:35,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} [122] 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] {689#true} is VALID [2022-04-15 02:22:35,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 02:22:35,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 02:22:35,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 02:22:35,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 02:22:35,060 INFO L272 TraceCheckUtils]: 15: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [108] L39-->__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] {689#true} is VALID [2022-04-15 02:22:35,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} [110] __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] {689#true} is VALID [2022-04-15 02:22:35,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} [115] 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[] {689#true} is VALID [2022-04-15 02:22:35,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-15 02:22:35,062 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {689#true} {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [124] __VERIFIER_assertEXIT-->L39-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] {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 02:22:35,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {727#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {690#false} is VALID [2022-04-15 02:22:35,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {690#false} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {690#false} is VALID [2022-04-15 02:22:35,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-15 02:22:35,063 INFO L272 TraceCheckUtils]: 23: Hoare triple {690#false} [108] L39-->__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] {690#false} is VALID [2022-04-15 02:22:35,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {690#false} [110] __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] {690#false} is VALID [2022-04-15 02:22:35,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {690#false} [114] 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[] {690#false} is VALID [2022-04-15 02:22:35,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {690#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-15 02:22:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:22:35,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:22:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:22:35,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896190993] [2022-04-15 02:22:35,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:22:35,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434747944] [2022-04-15 02:22:35,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434747944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:22:35,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:22:35,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:22:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083366715] [2022-04-15 02:22:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:22:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 02:22:35,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:22:35,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:22:35,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:22:35,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:22:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:22:35,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:22:35,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:22:35,094 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:22:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:35,184 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 02:22:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:22:35,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 02:22:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:22:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:22:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 02:22:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:22:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 02:22:35,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-15 02:22:35,245 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-15 02:22:35,246 INFO L225 Difference]: With dead ends: 57 [2022-04-15 02:22:35,247 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 02:22:35,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-15 02:22:35,248 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:22:35,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:22:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 02:22:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 02:22:35,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:22:35,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:35,267 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:35,268 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:35,272 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 02:22:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 02:22:35,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:35,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:35,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 02:22:35,281 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 02:22:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:22:35,285 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 02:22:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 02:22:35,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:22:35,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:22:35,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:22:35,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:22:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 02:22:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 02:22:35,287 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-15 02:22:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:22:35,288 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 02:22:35,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:22:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 02:22:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 02:22:35,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:22:35,289 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-15 02:22:35,317 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-15 02:22:35,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:22:35,490 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:22:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:22:35,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1664896543, now seen corresponding path program 1 times [2022-04-15 02:22:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:22:35,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207830402] [2022-04-15 02:22:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:22:35,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:22:35,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140641965] [2022-04-15 02:22:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:22:35,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:22:35,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:22:35,509 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-15 02:22:35,543 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-15 02:22:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:35,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 02:22:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:22:35,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:22:36,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:22:36,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} [89] 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) 10) (= (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] {966#true} is VALID [2022-04-15 02:22:36,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:22:36,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:22:36,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:22:36,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {966#true} is VALID [2022-04-15 02:22:36,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} [93] 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] {966#true} is VALID [2022-04-15 02:22:36,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} [95] 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] {992#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:22:36,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [100] 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[] {996#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:22:36,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {996#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {996#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:22:36,568 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {996#(not (= |assume_abort_if_not_#in~cond| 0))} {966#true} [122] 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] {1003#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-15 02:22:36,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {1003#(<= (mod main_~A~0 4294967296) 100)} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1007#(and (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(and (<= (mod main_~A~0 4294967296) 100) (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,578 INFO L272 TraceCheckUtils]: 17: Hoare triple {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [108] L39-->__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] {966#true} is VALID [2022-04-15 02:22:36,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} [110] __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] {966#true} is VALID [2022-04-15 02:22:36,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} [115] 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[] {966#true} is VALID [2022-04-15 02:22:36,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:22:36,581 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {966#true} {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L39-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] {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {1021#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1043#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} is VALID [2022-04-15 02:22:36,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {1043#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-15 02:22:36,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-15 02:22:36,601 INFO L272 TraceCheckUtils]: 25: Hoare triple {1047#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} [108] L39-->__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] {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:22:36,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __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] {1058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:22:36,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#(<= 1 __VERIFIER_assert_~cond)} [114] 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[] {967#false} is VALID [2022-04-15 02:22:36,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {967#false} is VALID [2022-04-15 02:22:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:22:36,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:23:06,629 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-15 02:23:14,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {967#false} is VALID [2022-04-15 02:23:14,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#(<= 1 __VERIFIER_assert_~cond)} [114] 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[] {967#false} is VALID [2022-04-15 02:23:14,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __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] {1058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:23:14,007 INFO L272 TraceCheckUtils]: 25: Hoare triple {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [108] L39-->__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] {1054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:23:14,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-15 02:23:15,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-15 02:23:17,226 WARN L290 TraceCheckUtils]: 22: Hoare triple {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1074#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-15 02:23:17,239 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {966#true} {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [124] __VERIFIER_assertEXIT-->L39-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] {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-15 02:23:17,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:23:17,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} [115] 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[] {966#true} is VALID [2022-04-15 02:23:17,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} [110] __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] {966#true} is VALID [2022-04-15 02:23:17,240 INFO L272 TraceCheckUtils]: 17: Hoare triple {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [108] L39-->__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] {966#true} is VALID [2022-04-15 02:23:17,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-15 02:23:17,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1084#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-15 02:23:17,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-15 02:23:19,382 WARN L290 TraceCheckUtils]: 13: Hoare triple {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1106#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-15 02:23:19,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-15 02:23:19,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1113#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-15 02:23:19,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {966#true} {966#true} [122] 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] {966#true} is VALID [2022-04-15 02:23:19,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {966#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:23:19,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {966#true} [100] 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[] {966#true} is VALID [2022-04-15 02:23:19,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} [95] 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] {966#true} is VALID [2022-04-15 02:23:19,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} [93] 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] {966#true} is VALID [2022-04-15 02:23:19,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {966#true} is VALID [2022-04-15 02:23:19,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:23:19,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:23:19,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:23:19,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} [89] 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) 10) (= (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] {966#true} is VALID [2022-04-15 02:23:19,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {966#true} is VALID [2022-04-15 02:23:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-15 02:23:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:23:19,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207830402] [2022-04-15 02:23:19,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:23:19,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140641965] [2022-04-15 02:23:19,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140641965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:23:19,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:23:19,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-15 02:23:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440984294] [2022-04-15 02:23:19,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:23:19,390 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-15 02:23:19,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:23:19,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 02:23:25,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 02:23:25,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 02:23:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:23:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 02:23:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=158, Unknown=6, NotChecked=26, Total=240 [2022-04-15 02:23:25,763 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 02:23:32,339 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-15 02:23:35,812 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-15 02:23:42,234 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-15 02:23:46,749 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-15 02:23:48,890 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-15 02:23:51,026 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-15 02:24:07,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:24:09,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:24:11,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:24:13,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:24:18,966 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-15 02:24:21,247 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-15 02:24:23,583 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-15 02:24:25,775 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-15 02:24:28,073 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-15 02:24:30,624 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-15 02:24:32,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:24:34,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:24:37,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:24:39,407 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-15 02:24:48,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:24:50,722 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-15 02:24:52,968 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-15 02:24:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:24:53,179 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-15 02:24:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 02:24:53,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-15 02:24:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:24:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 02:24:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-04-15 02:24:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 02:24:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-04-15 02:24:53,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 77 transitions. [2022-04-15 02:24:57,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 02:24:57,377 INFO L225 Difference]: With dead ends: 85 [2022-04-15 02:24:57,377 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 02:24:57,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=78, Invalid=258, Unknown=10, NotChecked=34, Total=380 [2022-04-15 02:24:57,379 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 24 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 51.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:24:57,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 154 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 191 Invalid, 23 Unknown, 45 Unchecked, 51.2s Time] [2022-04-15 02:24:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 02:24:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-15 02:24:57,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:24:57,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 02:24:57,409 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 02:24:57,409 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 02:24:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:24:57,412 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-15 02:24:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-15 02:24:57,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:24:57,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:24:57,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-15 02:24:57,413 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-15 02:24:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:24:57,416 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-15 02:24:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-15 02:24:57,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:24:57,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:24:57,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:24:57,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:24:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.186046511627907) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 02:24:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-04-15 02:24:57,420 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2022-04-15 02:24:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:24:57,420 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-04-15 02:24:57,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 02:24:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-15 02:24:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:24:57,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:24:57,421 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:24:57,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 02:24:57,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:24:57,627 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:24:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:24:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1490579311, now seen corresponding path program 2 times [2022-04-15 02:24:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:24:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108363696] [2022-04-15 02:24:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:24:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:24:57,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:24:57,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322337894] [2022-04-15 02:24:57,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 02:24:57,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:24:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:24:57,651 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-15 02:24:57,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process