/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_valuebound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:23:38,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:23:38,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:23:38,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:23:38,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:23:38,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:23:38,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:23:38,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:23:38,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:23:38,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:23:38,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:23:38,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:23:38,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:23:38,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:23:38,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:23:38,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:23:38,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:23:38,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:23:38,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:23:38,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:23:38,066 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:23:38,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:23:38,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:23:38,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:23:38,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:23:38,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:23:38,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:23:38,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:23:38,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:23:38,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:23:38,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:23:38,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:23:38,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:23:38,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:23:38,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:23:38,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:23:38,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:23:38,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:23:38,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:23:38,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:23:38,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:23:38,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:23:38,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:23:38,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:23:38,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:23:38,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:23:38,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:23:38,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:23:38,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:23:38,113 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:23:38,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:23:38,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:23:38,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:23:38,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:23:38,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:23:38,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:23:38,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:23:38,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:23:38,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:23:38,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:23:38,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:23:38,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:23:38,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:23:38,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:23:38,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:23:38,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:23:38,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:23:38,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:23:38,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:23:38,117 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:23:38,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:23:38,118 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:23:38,119 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:23:38,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:23:38,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:23:38,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:23:38,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:23:38,340 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:23:38,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i [2022-04-27 23:23:38,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ccdc3c/00eed1df8c714ecfaecc0d60cff81a00/FLAG996b403d4 [2022-04-27 23:23:38,746 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:23:38,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i [2022-04-27 23:23:38,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ccdc3c/00eed1df8c714ecfaecc0d60cff81a00/FLAG996b403d4 [2022-04-27 23:23:39,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ccdc3c/00eed1df8c714ecfaecc0d60cff81a00 [2022-04-27 23:23:39,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:23:39,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:23:39,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:23:39,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:23:39,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:23:39,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84418cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39, skipping insertion in model container [2022-04-27 23:23:39,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:23:39,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:23:39,397 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_valuebound2.i[951,964] [2022-04-27 23:23:39,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:23:39,436 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:23:39,453 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_valuebound2.i[951,964] [2022-04-27 23:23:39,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:23:39,486 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:23:39,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39 WrapperNode [2022-04-27 23:23:39,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:23:39,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:23:39,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:23:39,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:23:39,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:23:39,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:23:39,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:23:39,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:23:39,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:23:39,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:23:39,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:23:39,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:23:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:23:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:23:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:23:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:23:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:23:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:23:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:23:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:23:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 23:23:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 23:23:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:23:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:23:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 23:23:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:23:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:23:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:23:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:23:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:23:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:23:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:23:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:23:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:23:39,660 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:23:39,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:23:39,788 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:23:39,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:23:39,796 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:23:39,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:23:39 BoogieIcfgContainer [2022-04-27 23:23:39,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:23:39,799 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:23:39,799 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:23:39,800 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:23:39,804 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:23:39" (1/1) ... [2022-04-27 23:23:39,823 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:23:39,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:23:39 BasicIcfg [2022-04-27 23:23:39,846 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:23:39,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:23:39,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:23:39,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:23:39,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:23:39" (1/4) ... [2022-04-27 23:23:39,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b046d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:23:39, skipping insertion in model container [2022-04-27 23:23:39,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:23:39" (2/4) ... [2022-04-27 23:23:39,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b046d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:23:39, skipping insertion in model container [2022-04-27 23:23:39,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:23:39" (3/4) ... [2022-04-27 23:23:39,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b046d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:23:39, skipping insertion in model container [2022-04-27 23:23:39,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:23:39" (4/4) ... [2022-04-27 23:23:39,854 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.iqvasr [2022-04-27 23:23:39,867 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:23:39,868 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:23:39,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:23:39,916 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56066930, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6446c16 [2022-04-27 23:23:39,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:23:39,935 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-27 23:23:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 23:23:39,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:23:39,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:23:39,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:23:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:23:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash 483266332, now seen corresponding path program 1 times [2022-04-27 23:23:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:23:39,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030635006] [2022-04-27 23:23:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:23:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:23:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:40,131 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-27 23:23:40,131 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-27 23:23:40,132 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-27 23:23:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:23:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:40,142 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-27 23:23:40,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [99] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 23:23:40,143 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-27 23:23:40,144 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) 2) 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-27 23:23:40,145 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-27 23:23:40,145 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-27 23:23:40,146 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-27 23:23:40,146 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-27 23:23:40,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 23:23:40,147 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-27 23:23:40,147 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) 2) 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-27 23:23:40,147 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-27 23:23:40,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [99] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 23:23:40,150 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-27 23:23:40,150 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) 2) 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-27 23:23:40,151 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-27 23:23:40,151 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-27 23:23:40,151 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-27 23:23:40,152 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-27 23:23:40,152 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-27 23:23:40,152 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-27 23:23:40,152 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-27 23:23:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:23:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:23:40,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030635006] [2022-04-27 23:23:40,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030635006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:23:40,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:23:40,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:23:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470842737] [2022-04-27 23:23:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:23:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:23:40,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:23:40,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:40,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:40,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:23:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:23:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:23:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:23:40,254 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-27 23:23:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:40,365 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 23:23:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:23:40,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:23:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:23:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 23:23:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 23:23:40,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 23:23:40,452 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-27 23:23:40,460 INFO L225 Difference]: With dead ends: 51 [2022-04-27 23:23:40,460 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 23:23:40,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:23:40,465 INFO L413 NwaCegarLoop]: 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-27 23:23:40,466 INFO L414 NwaCegarLoop]: 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-27 23:23:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 23:23:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 23:23:40,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:23:40,494 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-27 23:23:40,494 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-27 23:23:40,495 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-27 23:23:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:40,498 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 23:23:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 23:23:40,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:40,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:40,500 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-27 23:23:40,500 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-27 23:23:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:40,503 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 23:23:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 23:23:40,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:40,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:40,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:23:40,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:23:40,505 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-27 23:23:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 23:23:40,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-27 23:23:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:23:40,508 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 23:23:40,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 23:23:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 23:23:40,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:23:40,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:23:40,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:23:40,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:23:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:23:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2138426952, now seen corresponding path program 1 times [2022-04-27 23:23:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:23:40,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271484362] [2022-04-27 23:23:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:23:40,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:23:40,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299481505] [2022-04-27 23:23:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:40,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:23:40,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:23:40,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:23:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:40,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 23:23:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:23:41,034 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-27 23:23:41,035 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-27 23:23:41,035 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-27 23:23:41,036 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-27 23:23:41,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 23:23:41,036 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-27 23:23:41,036 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) 2) 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-27 23:23:41,037 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-27 23:23:41,037 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-27 23:23:41,037 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-27 23:23:41,037 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) 2) 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-27 23:23:41,038 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-27 23:23:41,039 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-27 23:23:41,040 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-27 23:23:41,042 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-27 23:23:41,044 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-27 23:23:41,046 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-27 23:23:41,047 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-27 23:23:41,047 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-27 23:23:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:23:41,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:23:41,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:23:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271484362] [2022-04-27 23:23:41,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:23:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299481505] [2022-04-27 23:23:41,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299481505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:23:41,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:23:41,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 23:23:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984271337] [2022-04-27 23:23:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:23:41,058 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-27 23:23:41,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:23:41,060 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-27 23:23:41,080 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-27 23:23:41,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 23:23:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:23:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 23:23:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:23:41,082 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-27 23:23:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:43,433 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 23:23:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:23:43,433 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-27 23:23:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:23:43,434 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-27 23:23:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 23:23:43,436 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-27 23:23:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 23:23:43,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 23:23:43,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:43,488 INFO L225 Difference]: With dead ends: 37 [2022-04-27 23:23:43,489 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 23:23:43,489 INFO L412 NwaCegarLoop]: 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-27 23:23:43,490 INFO L413 NwaCegarLoop]: 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-27 23:23:43,490 INFO L414 NwaCegarLoop]: 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-27 23:23:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 23:23:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 23:23:43,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:23:43,497 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-27 23:23:43,497 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-27 23:23:43,498 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-27 23:23:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:43,500 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 23:23:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 23:23:43,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:43,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:43,502 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-27 23:23:43,502 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-27 23:23:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:43,505 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 23:23:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 23:23:43,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:43,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:43,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:23:43,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:23:43,506 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-27 23:23:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 23:23:43,508 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-27 23:23:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:23:43,509 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 23:23:43,509 INFO L496 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-27 23:23:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 23:23:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:23:43,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:23:43,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:23:43,538 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-27 23:23:43,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:43,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:23:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:23:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -554838191, now seen corresponding path program 1 times [2022-04-27 23:23:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:23:43,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340573872] [2022-04-27 23:23:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:23:43,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:23:43,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935283544] [2022-04-27 23:23:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:43,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:43,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:23:43,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:23:43,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:23:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:43,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 23:23:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:43,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:23:44,545 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-27 23:23:44,547 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-27 23:23:44,547 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-27 23:23:44,547 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-27 23:23:44,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 23:23:44,551 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-27 23:23:44,552 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) 2) 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-27 23:23:44,552 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-27 23:23:44,553 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-27 23:23:44,554 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-27 23:23:44,555 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) 2) 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) 2)} is VALID [2022-04-27 23:23:44,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= (mod main_~A~0 4294967296) 2)} [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 (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:44,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:44,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [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] {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:44,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:44,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [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[] {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:44,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:44,564 INFO L272 TraceCheckUtils]: 17: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [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] {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:23:44,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#(<= 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] {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:23:44,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 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-27 23:23:44,565 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-27 23:23:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:23:44,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:23:45,266 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-27 23:23:45,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 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-27 23:23:45,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#(<= 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] {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:23:45,268 INFO L272 TraceCheckUtils]: 17: Hoare triple {506#(forall ((main_~b~0 Int)) (= (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] {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:23:45,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#(forall ((main_~b~0 Int)) (= (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[] {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 23:23:45,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~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[] {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 23:23:45,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 23:23:45,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [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] {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 23:23:45,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 23:23:45,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#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] {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 23:23:45,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {425#true} {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) 2) 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-27 23:23:45,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 23:23:45,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {425#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[] {425#true} is VALID [2022-04-27 23:23:45,273 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] {425#true} is VALID [2022-04-27 23:23:45,273 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) 2) 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-27 23:23:45,273 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-27 23:23:45,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 23:23:45,273 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-27 23:23:45,274 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-27 23:23:45,274 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-27 23:23:45,274 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-27 23:23:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:23:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:23:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340573872] [2022-04-27 23:23:45,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:23:45,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935283544] [2022-04-27 23:23:45,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935283544] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:23:45,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:23:45,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 23:23:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516945678] [2022-04-27 23:23:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:23:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2022-04-27 23:23:45,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:23:45,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:45,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:45,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 23:23:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:23:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 23:23:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:23:45,495 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:45,691 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 23:23:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:23:45,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2022-04-27 23:23:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:23:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 23:23:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 23:23:45,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 23:23:47,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:47,772 INFO L225 Difference]: With dead ends: 42 [2022-04-27 23:23:47,773 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 23:23:47,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:23:47,774 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:23:47,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-27 23:23:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 23:23:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 23:23:47,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:23:47,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 23:23:47,784 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 23:23:47,784 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 23:23:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:47,787 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 23:23:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 23:23:47,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:47,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:47,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-27 23:23:47,789 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-27 23:23:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:47,792 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 23:23:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 23:23:47,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:47,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:47,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:23:47,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:23:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 23:23:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-27 23:23:47,795 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2022-04-27 23:23:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:23:47,796 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-27 23:23:47,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:23:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 23:23:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 23:23:47,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:23:47,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:23:47,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 23:23:48,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:23:48,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:23:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:23:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1600606598, now seen corresponding path program 1 times [2022-04-27 23:23:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:23:48,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253946714] [2022-04-27 23:23:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:23:48,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:23:48,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070562122] [2022-04-27 23:23:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:48,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:48,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:23:48,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:23:48,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:23:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:48,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:23:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:48,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:23:48,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {755#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#true} is VALID [2022-04-27 23:23:48,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {755#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] {755#true} is VALID [2022-04-27 23:23:48,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {755#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#true} is VALID [2022-04-27 23:23:48,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {755#true} {755#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#true} is VALID [2022-04-27 23:23:48,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {755#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#true} is VALID [2022-04-27 23:23:48,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {755#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] {755#true} is VALID [2022-04-27 23:23:48,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {755#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 2) 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] {755#true} is VALID [2022-04-27 23:23:48,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {755#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] {755#true} is VALID [2022-04-27 23:23:48,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {755#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[] {755#true} is VALID [2022-04-27 23:23:48,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#true} is VALID [2022-04-27 23:23:48,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {755#true} {755#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) 2) 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] {755#true} is VALID [2022-04-27 23:23:48,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#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] {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 23:23:48,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 23:23:48,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {793#(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[] {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 23:23:48,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 23:23:48,220 INFO L272 TraceCheckUtils]: 15: Hoare triple {793#(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] {755#true} is VALID [2022-04-27 23:23:48,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {755#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] {755#true} is VALID [2022-04-27 23:23:48,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#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[] {755#true} is VALID [2022-04-27 23:23:48,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {755#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#true} is VALID [2022-04-27 23:23:48,225 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {755#true} {793#(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] {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 23:23:48,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {793#(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] {756#false} is VALID [2022-04-27 23:23:48,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {756#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] {756#false} is VALID [2022-04-27 23:23:48,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {756#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#false} is VALID [2022-04-27 23:23:48,232 INFO L272 TraceCheckUtils]: 23: Hoare triple {756#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] {756#false} is VALID [2022-04-27 23:23:48,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {756#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] {756#false} is VALID [2022-04-27 23:23:48,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {756#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[] {756#false} is VALID [2022-04-27 23:23:48,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {756#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#false} is VALID [2022-04-27 23:23:48,234 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-27 23:23:48,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:23:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:23:48,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253946714] [2022-04-27 23:23:48,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:23:48,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070562122] [2022-04-27 23:23:48,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070562122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:23:48,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:23:48,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:23:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111769602] [2022-04-27 23:23:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:23:48,236 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-27 23:23:48,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:23:48,237 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-27 23:23:48,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:23:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:23:48,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:23:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:23:48,264 INFO L87 Difference]: Start difference. First operand 40 states and 44 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-27 23:23:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:48,358 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-27 23:23:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:23:48,358 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-27 23:23:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:23:48,359 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-27 23:23:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 23:23:48,361 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-27 23:23:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 23:23:48,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-27 23:23:48,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:48,415 INFO L225 Difference]: With dead ends: 51 [2022-04-27 23:23:48,415 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 23:23:48,415 INFO L412 NwaCegarLoop]: 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-27 23:23:48,416 INFO L413 NwaCegarLoop]: 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-27 23:23:48,417 INFO L414 NwaCegarLoop]: 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-27 23:23:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 23:23:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 23:23:48,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:23:48,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:48,423 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:48,423 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:48,426 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 23:23:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 23:23:48,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:48,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:48,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-27 23:23:48,427 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-27 23:23:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:48,429 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 23:23:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 23:23:48,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:48,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:48,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:23:48,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:23:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 23:23:48,432 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-27 23:23:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:23:48,432 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 23:23:48,432 INFO L496 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-27 23:23:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 23:23:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 23:23:48,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:23:48,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:23:48,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 23:23:48,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:48,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:23:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:23:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash -44144948, now seen corresponding path program 1 times [2022-04-27 23:23:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:23:48,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934834329] [2022-04-27 23:23:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:23:48,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:23:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079492843] [2022-04-27 23:23:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:23:48,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:23:48,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:23:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:48,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 23:23:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:48,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:23:48,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {1019#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:48,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {1019#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1019#true} {1019#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {1019#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:48,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {1019#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 2) 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] {1019#true} is VALID [2022-04-27 23:23:48,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:48,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#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[] {1019#true} is VALID [2022-04-27 23:23:48,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1019#true} {1019#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) 2) 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] {1019#true} is VALID [2022-04-27 23:23:48,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:48,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#true} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {1019#true} [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] {1019#true} is VALID [2022-04-27 23:23:48,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#true} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {1019#true} [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[] {1019#true} is VALID [2022-04-27 23:23:48,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {1019#true} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:48,987 INFO L272 TraceCheckUtils]: 17: Hoare triple {1019#true} [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] {1019#true} is VALID [2022-04-27 23:23:48,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {1019#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] {1078#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:23:48,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {1078#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [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[] {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:23:48,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:23:48,992 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} {1019#true} [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] {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 23:23:48,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [111] L39-1-->L38-1: Formula: (= (mod v_main_~B~0_1 4294967296) (mod v_main_~b~0_2 4294967296)) InVars {main_~b~0=v_main_~b~0_2, main_~B~0=v_main_~B~0_1} OutVars{main_~b~0=v_main_~b~0_2, main_~B~0=v_main_~B~0_1} AuxVars[] AssignedVars[] {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 23:23:48,993 INFO L272 TraceCheckUtils]: 23: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [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] {1096#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 23:23:48,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#(= |__VERIFIER_assert_#in~cond| 1)} [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] {1100#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 23:23:48,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#(= __VERIFIER_assert_~cond 1)} [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[] {1020#false} is VALID [2022-04-27 23:23:48,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {1020#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1020#false} is VALID [2022-04-27 23:23:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 23:23:48,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:23:50,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {1020#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1020#false} is VALID [2022-04-27 23:23:50,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {1110#(not (= __VERIFIER_assert_~cond 0))} [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[] {1020#false} is VALID [2022-04-27 23:23:50,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} [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] {1110#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:23:50,120 INFO L272 TraceCheckUtils]: 23: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [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] {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:23:50,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [111] L39-1-->L38-1: Formula: (= (mod v_main_~B~0_1 4294967296) (mod v_main_~b~0_2 4294967296)) InVars {main_~b~0=v_main_~b~0_2, main_~B~0=v_main_~B~0_1} OutVars{main_~b~0=v_main_~b~0_2, main_~B~0=v_main_~B~0_1} AuxVars[] AssignedVars[] {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 23:23:50,121 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} {1019#true} [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] {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 23:23:50,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:23:50,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {1132#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [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[] {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:23:50,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {1019#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] {1132#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:23:50,123 INFO L272 TraceCheckUtils]: 17: Hoare triple {1019#true} [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] {1019#true} is VALID [2022-04-27 23:23:50,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {1019#true} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {1019#true} [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[] {1019#true} is VALID [2022-04-27 23:23:50,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#true} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {1019#true} [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] {1019#true} is VALID [2022-04-27 23:23:50,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#true} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1019#true} {1019#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) 2) 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] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#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[] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {1019#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 2) 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] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:50,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1019#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1019#true} {1019#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {1019#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#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] {1019#true} is VALID [2022-04-27 23:23:50,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {1019#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1019#true} is VALID [2022-04-27 23:23:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 23:23:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:23:50,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934834329] [2022-04-27 23:23:50,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:23:50,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079492843] [2022-04-27 23:23:50,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079492843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:23:50,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:23:50,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 23:23:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878688069] [2022-04-27 23:23:50,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:23:50,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-27 23:23:50,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:23:50,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:23:50,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:50,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:23:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:23:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:23:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:23:50,162 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:23:51,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:23:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:53,596 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-27 23:23:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 23:23:53,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-27 23:23:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:23:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:23:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 23:23:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:23:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 23:23:53,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 23:23:53,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:23:53,634 INFO L225 Difference]: With dead ends: 39 [2022-04-27 23:23:53,634 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 23:23:53,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:23:53,635 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:23:53,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 23:23:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 23:23:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 23:23:53,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:23:53,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:53,641 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:53,641 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:53,643 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 23:23:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 23:23:53,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:53,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:53,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-27 23:23:53,644 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-27 23:23:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:23:53,645 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 23:23:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 23:23:53,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:23:53,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:23:53,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:23:53,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:23:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 23:23:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-27 23:23:53,647 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-27 23:23:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:23:53,647 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-27 23:23:53,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:23:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 23:23:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 23:23:53,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:23:53,649 INFO L195 NwaCegarLoop]: 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-27 23:23:53,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:23:53,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:53,873 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:23:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:23:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1664896543, now seen corresponding path program 1 times [2022-04-27 23:23:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:23:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686955667] [2022-04-27 23:23:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:23:53,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:23:53,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379401154] [2022-04-27 23:23:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:23:53,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:23:53,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:23:53,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:23:53,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 23:23:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:53,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 23:23:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:23:53,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:23:55,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {1354#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:23:55,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:23:55,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1354#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:23:55,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:23:55,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {1354#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:23:55,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:23:55,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {1354#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 2) 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] {1354#true} is VALID [2022-04-27 23:23:55,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {1354#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] {1380#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:23:55,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#(= 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[] {1384#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:23:55,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:23:55,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1384#(not (= |assume_abort_if_not_#in~cond| 0))} {1354#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) 2) 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] {1391#(<= (mod main_~A~0 4294967296) 2)} is VALID [2022-04-27 23:23:55,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {1391#(<= (mod main_~A~0 4294967296) 2)} [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] {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:55,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:55,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [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] {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:55,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-27 23:23:55,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} [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[] {1409#(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-27 23:23:55,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(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[] {1409#(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-27 23:23:55,055 INFO L272 TraceCheckUtils]: 17: Hoare triple {1409#(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] {1354#true} is VALID [2022-04-27 23:23:55,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:23:55,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {1354#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[] {1354#true} is VALID [2022-04-27 23:23:55,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {1354#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:23:55,057 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1354#true} {1409#(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] {1409#(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-27 23:23:55,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {1409#(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] {1431#(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-27 23:23:55,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {1431#(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] {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} is VALID [2022-04-27 23:23:55,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} is VALID [2022-04-27 23:23:55,062 INFO L272 TraceCheckUtils]: 25: Hoare triple {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~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] {1442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:23:55,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {1442#(<= 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] {1446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:23:55,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= 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[] {1355#false} is VALID [2022-04-27 23:23:55,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {1355#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#false} is VALID [2022-04-27 23:23:55,063 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-27 23:23:55,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:24:25,015 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-27 23:24:35,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {1355#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#false} is VALID [2022-04-27 23:24:35,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= 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[] {1355#false} is VALID [2022-04-27 23:24:35,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {1442#(<= 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] {1446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:24:35,919 INFO L272 TraceCheckUtils]: 25: Hoare triple {1462#(= (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] {1442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:24:35,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {1462#(= (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[] {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 23:24:37,928 WARN L290 TraceCheckUtils]: 23: Hoare triple {1462#(= (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] {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 23:24:39,931 WARN L290 TraceCheckUtils]: 22: Hoare triple {1472#(= (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] {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 23:24:39,932 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1354#true} {1472#(= (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] {1472#(= (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-27 23:24:39,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {1354#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:24:39,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {1354#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[] {1354#true} is VALID [2022-04-27 23:24:39,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:24:39,933 INFO L272 TraceCheckUtils]: 17: Hoare triple {1472#(= (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] {1354#true} is VALID [2022-04-27 23:24:39,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#(= (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[] {1472#(= (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-27 23:24:39,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {1494#(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[] {1472#(= (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-27 23:24:39,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1494#(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[] {1494#(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-27 23:24:42,058 WARN L290 TraceCheckUtils]: 13: Hoare triple {1501#(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] {1494#(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-27 23:24:42,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {1501#(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[] {1501#(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-27 23:24:42,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {1354#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] {1501#(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-27 23:24:42,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1354#true} {1354#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) 2) 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] {1354#true} is VALID [2022-04-27 23:24:42,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {1354#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:24:42,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {1354#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[] {1354#true} is VALID [2022-04-27 23:24:42,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:24:42,066 INFO L272 TraceCheckUtils]: 6: Hoare triple {1354#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 2) 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] {1354#true} is VALID [2022-04-27 23:24:42,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:24:42,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {1354#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:24:42,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:24:42,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1354#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:24:42,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#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] {1354#true} is VALID [2022-04-27 23:24:42,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {1354#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1354#true} is VALID [2022-04-27 23:24:42,067 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-27 23:24:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:24:42,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686955667] [2022-04-27 23:24:42,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:24:42,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379401154] [2022-04-27 23:24:42,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379401154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:24:42,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:24:42,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-27 23:24:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209422623] [2022-04-27 23:24:42,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:24:42,069 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-27 23:24:42,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:24:42,069 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-27 23:24:48,414 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-27 23:24:48,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 23:24:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:24:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 23:24:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=4, NotChecked=26, Total=240 [2022-04-27 23:24:48,415 INFO L87 Difference]: Start difference. First operand 32 states and 34 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-27 23:24:54,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:01,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:12,398 WARN L232 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 23:25:14,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:18,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:20,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:27,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:29,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:32,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:34,213 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-27 23:25:40,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:25:43,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:52,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:54,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:56,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:25:58,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:26:00,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:26:02,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:26:07,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:26:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:26:07,279 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-27 23:26:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 23:26:07,279 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-27 23:26:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:26:07,280 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-27 23:26:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2022-04-27 23:26:07,282 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-27 23:26:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2022-04-27 23:26:07,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 71 transitions. [2022-04-27 23:26:11,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 69 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 23:26:11,610 INFO L225 Difference]: With dead ends: 67 [2022-04-27 23:26:11,611 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 23:26:11,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=68, Invalid=237, Unknown=5, NotChecked=32, Total=342 [2022-04-27 23:26:11,612 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 16 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:26:11,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 167 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 146 Invalid, 18 Unknown, 39 Unchecked, 39.1s Time] [2022-04-27 23:26:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 23:26:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-27 23:26:11,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:26:11,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 23:26:11,630 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 23:26:11,630 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 23:26:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:26:11,633 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-27 23:26:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-27 23:26:11,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:26:11,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:26:11,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-27 23:26:11,634 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-27 23:26:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:26:11,636 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-27 23:26:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-27 23:26:11,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:26:11,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:26:11,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:26:11,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:26:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 23:26:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-27 23:26:11,639 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 29 [2022-04-27 23:26:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:26:11,639 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-27 23:26:11,640 INFO L496 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-27 23:26:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-27 23:26:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 23:26:11,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:26:11,640 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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-27 23:26:11,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 23:26:11,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:26:11,846 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:26:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:26:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash -948346601, now seen corresponding path program 1 times [2022-04-27 23:26:11,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:26:11,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240854236] [2022-04-27 23:26:11,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:26:11,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:26:11,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:26:11,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81421833] [2022-04-27 23:26:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:26:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:26:11,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:26:11,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:26:11,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process