/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/divbin2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:34:33,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:34:33,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:34:33,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:34:33,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:34:33,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:34:33,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:34:33,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:34:33,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:34:33,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:34:33,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:34:33,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:34:33,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:34:33,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:34:33,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:34:33,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:34:33,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:34:33,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:34:33,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:34:33,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:34:33,973 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:34:33,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:34:33,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:34:33,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:34:33,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:34:33,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:34:33,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:34:33,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:34:33,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:34:33,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:34:33,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:34:33,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:34:33,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:34:33,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:34:33,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:34:33,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:34:33,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:34:33,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:34:33,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:34:33,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:34:33,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:34:33,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:34:33,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:34:34,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:34:34,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:34:34,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:34:34,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:34:34,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:34:34,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:34:34,016 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:34:34,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:34:34,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:34:34,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:34:34,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:34:34,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:34:34,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:34:34,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:34:34,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:34:34,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:34:34,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:34:34,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:34:34,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:34:34,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:34:34,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:34:34,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:34:34,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:34:34,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:34:34,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:34:34,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:34:34,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:34:34,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:34:34,020 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:34:34,020 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-07 23:34:34,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:34:34,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:34:34,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:34:34,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:34:34,231 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:34:34,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-07 23:34:34,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc04562b0/4f6148ee42dd47a88301add82273b32e/FLAG3a4f3318c [2022-04-07 23:34:34,612 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:34:34,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-07 23:34:34,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc04562b0/4f6148ee42dd47a88301add82273b32e/FLAG3a4f3318c [2022-04-07 23:34:34,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc04562b0/4f6148ee42dd47a88301add82273b32e [2022-04-07 23:34:34,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:34:34,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:34:34,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:34:34,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:34:34,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:34:34,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f057bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34, skipping insertion in model container [2022-04-07 23:34:34,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:34:34,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:34:34,760 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/divbin2.i[951,964] [2022-04-07 23:34:34,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:34:34,773 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:34:34,797 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/divbin2.i[951,964] [2022-04-07 23:34:34,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:34:34,824 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:34:34,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34 WrapperNode [2022-04-07 23:34:34,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:34:34,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:34:34,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:34:34,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:34:34,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:34:34,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:34:34,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:34:34,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:34:34,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (1/1) ... [2022-04-07 23:34:34,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:34:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:34,887 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-07 23:34:34,904 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-07 23:34:34,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:34:34,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:34:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:34:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:34:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:34:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:34:34,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:34:34,917 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:34:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 23:34:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 23:34:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:34:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:34:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:34:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:34:34,971 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:34:34,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:34:35,078 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:34:35,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:34:35,083 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 23:34:35,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:34:35 BoogieIcfgContainer [2022-04-07 23:34:35,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:34:35,085 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:34:35,085 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:34:35,085 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:34:35,087 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:34:35" (1/1) ... [2022-04-07 23:34:35,089 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:34:35,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:34:35 BasicIcfg [2022-04-07 23:34:35,113 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:34:35,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:34:35,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:34:35,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:34:35,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:34:34" (1/4) ... [2022-04-07 23:34:35,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20369106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:34:35, skipping insertion in model container [2022-04-07 23:34:35,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:34:34" (2/4) ... [2022-04-07 23:34:35,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20369106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:34:35, skipping insertion in model container [2022-04-07 23:34:35,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:34:35" (3/4) ... [2022-04-07 23:34:35,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20369106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:34:35, skipping insertion in model container [2022-04-07 23:34:35,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:34:35" (4/4) ... [2022-04-07 23:34:35,118 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2.iqvasr [2022-04-07 23:34:35,135 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:34:35,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:34:35,171 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:34:35,175 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 23:34:35,175 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:34:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 23:34:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:34:35,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:35,197 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:35,197 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:35,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -852214585, now seen corresponding path program 1 times [2022-04-07 23:34:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:35,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320323139] [2022-04-07 23:34:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:34:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:35,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [85] 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] {27#true} is VALID [2022-04-07 23:34:35,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:34:35,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:34:35,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:34:35,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [85] 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] {27#true} is VALID [2022-04-07 23:34:35,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:34:35,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:34:35,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:34:35,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {27#true} is VALID [2022-04-07 23:34:35,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [89] L33-2-->L42-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 23:34:35,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} [92] L42-2-->L37-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 23:34:35,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [97] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {28#false} is VALID [2022-04-07 23:34:35,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [100] __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] {28#false} is VALID [2022-04-07 23:34:35,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [104] 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[] {28#false} is VALID [2022-04-07 23:34:35,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 23:34:35,387 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-07 23:34:35,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:35,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320323139] [2022-04-07 23:34:35,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320323139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:34:35,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:34:35,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:34:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014576564] [2022-04-07 23:34:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:34:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:34:35,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:35,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:35,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:35,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:34:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:34:35,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:34:35,432 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:35,526 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-07 23:34:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:34:35,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:34:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-07 23:34:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-07 23:34:35,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-07 23:34:35,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:35,608 INFO L225 Difference]: With dead ends: 40 [2022-04-07 23:34:35,608 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 23:34:35,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07 23:34:35,612 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:35,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:34:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 23:34:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 23:34:35,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:35,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:35,636 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:35,637 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:35,647 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-07 23:34:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-07 23:34:35,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:35,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:35,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 23:34:35,648 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 23:34:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:35,651 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-07 23:34:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-07 23:34:35,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:35,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:35,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:35,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-07 23:34:35,660 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-07 23:34:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:35,660 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-07 23:34:35,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-07 23:34:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 23:34:35,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:35,662 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:35,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:34:35,662 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1209212451, now seen corresponding path program 1 times [2022-04-07 23:34:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660079563] [2022-04-07 23:34:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:35,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:34:35,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279054053] [2022-04-07 23:34:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:35,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:35,704 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-07 23:34:35,705 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-07 23:34:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:35,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 23:34:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:35,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:34:36,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {151#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-07 23:34:36,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} [85] 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] {151#true} is VALID [2022-04-07 23:34:36,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-07 23:34:36,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-07 23:34:36,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {151#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-07 23:34:36,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [95] L34-->L42-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, 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[] {178#(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-07 23:34:36,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(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))} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#(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-07 23:34:36,100 INFO L272 TraceCheckUtils]: 9: Hoare triple {178#(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))} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:34:36,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __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] {189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:34:36,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#(<= 1 __VERIFIER_assert_~cond)} [104] 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[] {152#false} is VALID [2022-04-07 23:34:36,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#false} is VALID [2022-04-07 23:34:36,102 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-07 23:34:36,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:34:36,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:36,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660079563] [2022-04-07 23:34:36,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:34:36,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279054053] [2022-04-07 23:34:36,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279054053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:34:36,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:34:36,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 23:34:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609059252] [2022-04-07 23:34:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:34:36,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 23:34:36,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:36,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:36,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:36,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:34:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:34:36,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:34:36,116 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:36,254 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-07 23:34:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:34:36,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 23:34:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-07 23:34:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-07 23:34:36,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-07 23:34:36,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:36,310 INFO L225 Difference]: With dead ends: 31 [2022-04-07 23:34:36,310 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 23:34:36,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-07 23:34:36,311 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:36,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:34:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 23:34:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 23:34:36,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:36,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-07 23:34:36,318 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-07 23:34:36,318 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-07 23:34:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:36,320 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-07 23:34:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-07 23:34:36,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:36,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:36,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 28 states. [2022-04-07 23:34:36,321 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 28 states. [2022-04-07 23:34:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:36,323 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-07 23:34:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-07 23:34:36,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:36,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:36,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:36,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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-07 23:34:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-07 23:34:36,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2022-04-07 23:34:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:36,326 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-07 23:34:36,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-07 23:34:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 23:34:36,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:36,327 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:36,352 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-07 23:34:36,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:36,544 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1400683102, now seen corresponding path program 1 times [2022-04-07 23:34:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166989625] [2022-04-07 23:34:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:36,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:34:36,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677765699] [2022-04-07 23:34:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:36,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:36,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:36,562 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-07 23:34:36,564 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-07 23:34:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:36,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 23:34:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:36,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:34:36,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {335#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:36,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} [85] 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] {335#true} is VALID [2022-04-07 23:34:36,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:36,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {335#true} {335#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:36,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {335#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:36,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [96] L34-->L33-2: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [95] L34-->L42-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, 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[] {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 23:34:36,903 INFO L272 TraceCheckUtils]: 11: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:34:36,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {375#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __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] {379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:34:36,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(<= 1 __VERIFIER_assert_~cond)} [104] 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[] {336#false} is VALID [2022-04-07 23:34:36,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#false} is VALID [2022-04-07 23:34:36,905 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-07 23:34:36,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:34:37,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#false} is VALID [2022-04-07 23:34:37,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(<= 1 __VERIFIER_assert_~cond)} [104] 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[] {336#false} is VALID [2022-04-07 23:34:37,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {375#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __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] {379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:34:37,259 INFO L272 TraceCheckUtils]: 11: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:34:37,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#(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-07 23:34:37,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [95] L34-->L42-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, 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[] {395#(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-07 23:34:37,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#(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-07 23:34:37,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(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))))} [96] L34-->L33-2: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {395#(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-07 23:34:37,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(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))))} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {408#(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-07 23:34:37,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {408#(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-07 23:34:37,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {335#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:37,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {335#true} {335#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:37,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:37,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} [85] 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] {335#true} is VALID [2022-04-07 23:34:37,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {335#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#true} is VALID [2022-04-07 23:34:37,265 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-07 23:34:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:37,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166989625] [2022-04-07 23:34:37,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:34:37,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677765699] [2022-04-07 23:34:37,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677765699] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:34:37,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 23:34:37,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-07 23:34:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253337613] [2022-04-07 23:34:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:34:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 23:34:37,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:37,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:37,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:37,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:34:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:37,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:34:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-07 23:34:37,509 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:37,626 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-07 23:34:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:34:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 23:34:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 23:34:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 23:34:37,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-07 23:34:38,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:38,073 INFO L225 Difference]: With dead ends: 36 [2022-04-07 23:34:38,073 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 23:34:38,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-07 23:34:38,074 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:38,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-04-07 23:34:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 23:34:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 23:34:38,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:38,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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-07 23:34:38,082 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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-07 23:34:38,082 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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-07 23:34:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:38,084 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 23:34:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 23:34:38,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:38,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:38,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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 34 states. [2022-04-07 23:34:38,085 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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 34 states. [2022-04-07 23:34:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:38,087 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 23:34:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 23:34:38,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:38,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:38,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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-07 23:34:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 23:34:38,089 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2022-04-07 23:34:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:38,090 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 23:34:38,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:34:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 23:34:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 23:34:38,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:38,091 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:38,109 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-07 23:34:38,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 23:34:38,304 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash 307306426, now seen corresponding path program 1 times [2022-04-07 23:34:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:38,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75839216] [2022-04-07 23:34:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:38,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:34:38,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329772331] [2022-04-07 23:34:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:38,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:38,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:38,317 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-07 23:34:38,319 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-07 23:34:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:38,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 23:34:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:38,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:34:38,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {598#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} [85] 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] {598#true} is VALID [2022-04-07 23:34:38,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {598#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {598#true} is VALID [2022-04-07 23:34:38,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#true} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#true} [96] L34-->L33-2: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {598#true} is VALID [2022-04-07 23:34:38,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#true} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#true} [95] L34-->L42-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, 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[] {598#true} is VALID [2022-04-07 23:34:38,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#true} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:38,519 INFO L272 TraceCheckUtils]: 11: Hoare triple {598#true} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {598#true} is VALID [2022-04-07 23:34:38,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#true} [100] __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] {639#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:34:38,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {639#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [105] 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[] {643#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:34:38,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {643#(not (= |__VERIFIER_assert_#in~cond| 0))} [110] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:34:38,523 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {643#(not (= |__VERIFIER_assert_#in~cond| 0))} {598#true} [113] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 23:34:38,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [101] L38-1-->L37-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[] {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 23:34:38,525 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [97] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {657#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 23:34:38,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {657#(= |__VERIFIER_assert_#in~cond| 1)} [100] __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] {661#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 23:34:38,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(= __VERIFIER_assert_~cond 1)} [104] 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[] {599#false} is VALID [2022-04-07 23:34:38,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {599#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599#false} is VALID [2022-04-07 23:34:38,526 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-07 23:34:38,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:34:39,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {599#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599#false} is VALID [2022-04-07 23:34:39,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#(not (= __VERIFIER_assert_~cond 0))} [104] 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[] {599#false} is VALID [2022-04-07 23:34:39,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {643#(not (= |__VERIFIER_assert_#in~cond| 0))} [100] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:34:39,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [97] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~A~0_7 4294967296) (mod (+ v_main_~r~0_12 (* v_main_~q~0_11 v_main_~b~0_15)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~A~0=v_main_~A~0_7, main_~b~0=v_main_~b~0_15, main_~r~0=v_main_~r~0_12} 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] {643#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:34:39,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [101] L38-1-->L37-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[] {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 23:34:39,346 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {643#(not (= |__VERIFIER_assert_#in~cond| 0))} {598#true} [113] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {650#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 23:34:39,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {643#(not (= |__VERIFIER_assert_#in~cond| 0))} [110] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {643#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:34:39,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {693#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [105] 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[] {643#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:34:39,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#true} [100] __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] {693#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:34:39,349 INFO L272 TraceCheckUtils]: 11: Hoare triple {598#true} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {598#true} is VALID [2022-04-07 23:34:39,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#true} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#true} [95] L34-->L42-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, 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[] {598#true} is VALID [2022-04-07 23:34:39,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#true} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#true} [96] L34-->L33-2: Formula: (and (= (* 2 v_main_~b~0_13) v_main_~b~0_12) (<= (mod v_main_~b~0_13 4294967296) (mod v_main_~r~0_10 4294967296))) InVars {main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~b~0] {598#true} is VALID [2022-04-07 23:34:39,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#true} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {598#true} is VALID [2022-04-07 23:34:39,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {598#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} [85] 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] {598#true} is VALID [2022-04-07 23:34:39,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {598#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#true} is VALID [2022-04-07 23:34:39,350 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-07 23:34:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:39,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75839216] [2022-04-07 23:34:39,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:34:39,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329772331] [2022-04-07 23:34:39,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329772331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:34:39,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:34:39,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-07 23:34:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719471095] [2022-04-07 23:34:39,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 23:34:39,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 23:34:39,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:39,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:34:39,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:39,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 23:34:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 23:34:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 23:34:39,367 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:34:41,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:34:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:41,759 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-07 23:34:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 23:34:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 23:34:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:34:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-07 23:34:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:34:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-07 23:34:41,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-07 23:34:41,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:41,790 INFO L225 Difference]: With dead ends: 40 [2022-04-07 23:34:41,790 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 23:34:41,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-07 23:34:41,791 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:41,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 23:34:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 23:34:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-04-07 23:34:41,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:41,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:41,796 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:41,796 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:41,797 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 23:34:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 23:34:41,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:41,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:41,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-07 23:34:41,798 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-07 23:34:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:41,799 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 23:34:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 23:34:41,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:41,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:41,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:41,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-07 23:34:41,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2022-04-07 23:34:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:41,801 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-07 23:34:41,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:34:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 23:34:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 23:34:41,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:41,801 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:41,832 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-07 23:34:42,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:42,002 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1801492333, now seen corresponding path program 1 times [2022-04-07 23:34:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:42,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877719498] [2022-04-07 23:34:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:42,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:34:42,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470173687] [2022-04-07 23:34:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:42,027 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-07 23:34:42,028 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-07 23:34:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:42,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 23:34:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:34:42,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:34:42,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {889#true} [83] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 23:34:42,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#true} [85] 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] {889#true} is VALID [2022-04-07 23:34:42,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {889#true} [88] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 23:34:42,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {889#true} {889#true} [111] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 23:34:42,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {889#true} [84] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 23:34:42,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#true} [87] mainENTRY-->L33-2: Formula: (and (= v_main_~B~0_3 1) (= v_main_~B~0_3 v_main_~b~0_5) (= v_main_~A~0_2 |v_main_#t~nondet1_2|) (= v_main_~q~0_4 0) (= v_main_~A~0_2 v_main_~r~0_2)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5, main_~A~0=v_main_~A~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~b~0, main_~A~0, main_~r~0] {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 23:34:42,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [91] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 23:34:42,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [95] L34-->L42-2: Formula: (not (<= (mod v_main_~b~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~b~0=v_main_~b~0_11, 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[] {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 23:34:42,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 23:34:42,130 INFO L272 TraceCheckUtils]: 9: Hoare triple {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {889#true} is VALID [2022-04-07 23:34:42,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {889#true} [100] __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] {889#true} is VALID [2022-04-07 23:34:42,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {889#true} [105] 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[] {889#true} is VALID [2022-04-07 23:34:42,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {889#true} [110] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#true} is VALID [2022-04-07 23:34:42,131 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {889#true} {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [113] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 23:34:42,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {909#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [102] L38-1-->L42: Formula: (let ((.cse0 (mod v_main_~b~0_4 4294967296))) (and (not (= .cse0 (mod v_main_~B~0_2 4294967296))) (= v_main_~q~0_2 (* v_main_~q~0_3 2)) (= v_main_~b~0_3 (div .cse0 2)))) InVars {main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {890#false} is VALID [2022-04-07 23:34:42,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {890#false} [106] L42-->L42-2: Formula: (and (<= (mod v_main_~b~0_8 4294967296) (mod v_main_~r~0_6 4294967296)) (= v_main_~q~0_7 (+ v_main_~q~0_8 1)) (= (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_6) v_main_~r~0_5)) InVars {main_~q~0=v_main_~q~0_8, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_6} OutVars{main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {890#false} is VALID [2022-04-07 23:34:42,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {890#false} [94] L42-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {890#false} is VALID [2022-04-07 23:34:42,142 INFO L272 TraceCheckUtils]: 17: Hoare triple {890#false} [98] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_6 4294967296) (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_6, 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_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {890#false} is VALID [2022-04-07 23:34:42,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {890#false} [100] __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] {890#false} is VALID [2022-04-07 23:34:42,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {890#false} [104] 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[] {890#false} is VALID [2022-04-07 23:34:42,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#false} [108] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {890#false} is VALID [2022-04-07 23:34:42,143 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-07 23:34:42,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:34:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:34:42,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877719498] [2022-04-07 23:34:42,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:34:42,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470173687] [2022-04-07 23:34:42,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470173687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:34:42,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:34:42,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:34:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432586639] [2022-04-07 23:34:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:34:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 23:34:42,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:34:42,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:42,160 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-07 23:34:42,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:34:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:34:42,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:34:42,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:34:42,161 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:42,215 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-07 23:34:42,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:34:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 23:34:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:34:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-07 23:34:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-07 23:34:42,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-07 23:34:42,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:34:42,265 INFO L225 Difference]: With dead ends: 39 [2022-04-07 23:34:42,265 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 23:34:42,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-07 23:34:42,266 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:34:42,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:34:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 23:34:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 23:34:42,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:34:42,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:42,275 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:42,275 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:42,276 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 23:34:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 23:34:42,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:42,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:42,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-07 23:34:42,277 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-07 23:34:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:34:42,278 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 23:34:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 23:34:42,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:34:42,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:34:42,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:34:42,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:34:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:34:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-07 23:34:42,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2022-04-07 23:34:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:34:42,279 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-07 23:34:42,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 23:34:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 23:34:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 23:34:42,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:34:42,280 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:34:42,296 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-07 23:34:42,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:42,487 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:34:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:34:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 108173774, now seen corresponding path program 1 times [2022-04-07 23:34:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:34:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334506661] [2022-04-07 23:34:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:34:42,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:34:42,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214665860] [2022-04-07 23:34:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:34:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:34:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:34:42,498 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-07 23:34:42,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process