/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:08:30,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:08:30,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:08:30,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:08:30,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:08:30,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:08:30,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:08:30,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:08:30,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:08:30,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:08:30,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:08:30,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:08:30,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:08:30,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:08:30,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:08:30,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:08:30,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:08:30,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:08:30,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:08:30,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:08:30,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:08:30,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:08:30,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:08:30,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:08:30,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:08:30,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:08:30,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:08:30,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:08:30,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:08:30,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:08:30,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:08:30,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:08:30,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:08:30,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:08:30,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:08:30,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:08:30,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:08:30,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:08:30,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:08:30,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:08:30,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:08:30,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:08:30,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:08:30,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:08:30,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:08:30,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:08:30,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:08:30,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:08:30,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:08:30,969 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:08:30,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:08:30,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:08:30,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:08:30,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:08:30,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:08:30,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:08:30,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:08:30,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:08:30,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:08:30,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:08:30,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:08:30,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:30,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:08:30,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:08:30,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:08:30,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:08:30,973 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:08:31,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:08:31,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:08:31,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:08:31,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:08:31,197 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:08:31,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-27 23:08:31,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1fabf9f/f26105f5a96448f8b2b789c8aa2d1c97/FLAGe5c962fdc [2022-04-27 23:08:31,619 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:08:31,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-27 23:08:31,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1fabf9f/f26105f5a96448f8b2b789c8aa2d1c97/FLAGe5c962fdc [2022-04-27 23:08:31,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1fabf9f/f26105f5a96448f8b2b789c8aa2d1c97 [2022-04-27 23:08:31,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:08:31,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:08:31,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:31,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:08:31,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:08:31,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acea181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31, skipping insertion in model container [2022-04-27 23:08:31,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:08:31,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:08:31,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c[525,538] [2022-04-27 23:08:31,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:31,846 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:08:31,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c[525,538] [2022-04-27 23:08:31,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:31,883 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:08:31,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31 WrapperNode [2022-04-27 23:08:31,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:31,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:08:31,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:08:31,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:08:31,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:08:31,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:08:31,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:08:31,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:08:31,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (1/1) ... [2022-04-27 23:08:31,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:31,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:31,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:08:31,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:08:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:08:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:08:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:08:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:08:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:08:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:08:31,973 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:08:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:08:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:08:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:08:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:08:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:08:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:08:32,029 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:08:32,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:08:32,252 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:08:32,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:08:32,259 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:08:32,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:32 BoogieIcfgContainer [2022-04-27 23:08:32,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:08:32,261 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:08:32,261 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:08:32,262 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:08:32,265 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:32" (1/1) ... [2022-04-27 23:08:32,268 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:08:32,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:32 BasicIcfg [2022-04-27 23:08:32,295 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:08:32,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:08:32,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:08:32,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:08:32,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:08:31" (1/4) ... [2022-04-27 23:08:32,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f86ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:32, skipping insertion in model container [2022-04-27 23:08:32,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:31" (2/4) ... [2022-04-27 23:08:32,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f86ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:32, skipping insertion in model container [2022-04-27 23:08:32,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:32" (3/4) ... [2022-04-27 23:08:32,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f86ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:08:32, skipping insertion in model container [2022-04-27 23:08:32,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:32" (4/4) ... [2022-04-27 23:08:32,303 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.cqvasr [2022-04-27 23:08:32,314 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:08:32,315 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:08:32,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:08:32,367 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62bdb952, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ca6dee8 [2022-04-27 23:08:32,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:08:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 23:08:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 23:08:32,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:32,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:32,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash -460462115, now seen corresponding path program 1 times [2022-04-27 23:08:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:32,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135015532] [2022-04-27 23:08:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:32,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 23:08:32,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:32,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:32,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:32,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 23:08:32,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:32,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 23:08:32,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:32,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:32,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 23:08:32,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#true} is VALID [2022-04-27 23:08:32,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 23:08:32,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 23:08:32,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 23:08:32,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:32,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} [114] L30-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} [118] L52-2-->L38-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,549 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-27 23:08:32,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} [129] __VERIFIER_assertENTRY-->L12: 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] {43#false} is VALID [2022-04-27 23:08:32,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [132] L12-->L13: 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[] {43#false} is VALID [2022-04-27 23:08:32,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 23:08:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:32,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135015532] [2022-04-27 23:08:32,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135015532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:32,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:32,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:08:32,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963840222] [2022-04-27 23:08:32,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:08:32,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:32,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:32,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:32,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:08:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:08:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:32,628 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:33,606 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 23:08:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:08:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 23:08:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:08:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:08:33,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 23:08:33,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:33,762 INFO L225 Difference]: With dead ends: 70 [2022-04-27 23:08:33,762 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 23:08:33,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:33,774 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:33,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 23:08:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 23:08:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 23:08:33,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:33,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:33,803 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:33,804 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:33,808 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 23:08:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 23:08:33,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:33,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:33,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 23:08:33,810 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 23:08:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:33,814 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 23:08:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 23:08:33,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:33,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:33,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:33,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 23:08:33,820 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 23:08:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:33,820 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 23:08:33,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 23:08:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 23:08:33,821 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:33,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:33,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:08:33,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -889932734, now seen corresponding path program 1 times [2022-04-27 23:08:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:33,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077581330] [2022-04-27 23:08:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:33,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475566858] [2022-04-27 23:08:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:33,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:33,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:08:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:33,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:08:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:33,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:34,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:34,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:34,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {316#(<= |main_#t~post5| 0)} is VALID [2022-04-27 23:08:34,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {275#false} is VALID [2022-04-27 23:08:34,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {275#false} is VALID [2022-04-27 23:08:34,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {275#false} is VALID [2022-04-27 23:08:34,113 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {275#false} is VALID [2022-04-27 23:08:34,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} [129] __VERIFIER_assertENTRY-->L12: 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] {275#false} is VALID [2022-04-27 23:08:34,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} [132] L12-->L13: 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[] {275#false} is VALID [2022-04-27 23:08:34,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:08:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:34,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:34,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077581330] [2022-04-27 23:08:34,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475566858] [2022-04-27 23:08:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475566858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:34,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:34,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:08:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357380680] [2022-04-27 23:08:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 23:08:34,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:34,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:34,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 23:08:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 23:08:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:08:34,137 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:41,144 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 23:08:41,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 23:08:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 23:08:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 23:08:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 23:08:41,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 23:08:41,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:41,244 INFO L225 Difference]: With dead ends: 55 [2022-04-27 23:08:41,245 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 23:08:41,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:08:41,248 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 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-27 23:08:41,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 23:08:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 23:08:41,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:41,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:41,269 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:41,270 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:41,279 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 23:08:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:41,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:41,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:41,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 23:08:41,287 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 23:08:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:41,289 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 23:08:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:41,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:41,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:41,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:41,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 23:08:41,293 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 23:08:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:41,293 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 23:08:41,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 23:08:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:08:41,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:41,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:41,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:41,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:41,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1699853977, now seen corresponding path program 1 times [2022-04-27 23:08:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:41,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376741767] [2022-04-27 23:08:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:41,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:08:41,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286921057] [2022-04-27 23:08:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:08:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:41,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:08:41,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:08:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:41,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:08:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:41,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:08:41,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#true} is VALID [2022-04-27 23:08:41,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,747 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-27 23:08:41,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:41,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:41,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {588#(<= ~counter~0 1)} is VALID [2022-04-27 23:08:41,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {598#(<= |main_#t~post6| 1)} is VALID [2022-04-27 23:08:41,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {547#false} is VALID [2022-04-27 23:08:41,752 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {547#false} is VALID [2022-04-27 23:08:41,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} [129] __VERIFIER_assertENTRY-->L12: 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] {547#false} is VALID [2022-04-27 23:08:41,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} [132] L12-->L13: 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[] {547#false} is VALID [2022-04-27 23:08:41,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-27 23:08:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:41,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:08:41,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:41,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376741767] [2022-04-27 23:08:41,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:08:41,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286921057] [2022-04-27 23:08:41,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286921057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:41,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:41,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:08:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902510830] [2022-04-27 23:08:41,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 23:08:41,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:41,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:41,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:41,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:08:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:08:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:08:41,772 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:48,185 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 23:08:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:08:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 23:08:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:08:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:08:48,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 23:08:48,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:48,250 INFO L225 Difference]: With dead ends: 49 [2022-04-27 23:08:48,250 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 23:08:48,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:08:48,251 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:48,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:08:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 23:08:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 23:08:48,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:48,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:48,260 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:48,261 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:48,263 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 23:08:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 23:08:48,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:48,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:48,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 23:08:48,265 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 23:08:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:48,267 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 23:08:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 23:08:48,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:48,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:48,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:48,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 23:08:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 23:08:48,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 23:08:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:48,271 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 23:08:48,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:08:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 23:08:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 23:08:48,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:48,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:08:48,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:08:48,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:08:48,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1700986035, now seen corresponding path program 1 times [2022-04-27 23:08:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:48,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101504875] [2022-04-27 23:08:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:48,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {822#true} is VALID [2022-04-27 23:08:48,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:48,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-27 23:08:48,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:48,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:48,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {822#true} is VALID [2022-04-27 23:08:48,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {822#true} is VALID [2022-04-27 23:08:48,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:48,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-27 23:08:48,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-27 23:08:48,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-27 23:08:48,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:48,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:48,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:48,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:48,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:48,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:48,776 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:48,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: 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] {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:08:48,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: 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[] {823#false} is VALID [2022-04-27 23:08:48,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-27 23:08:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:08:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:48,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101504875] [2022-04-27 23:08:48,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101504875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:48,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:48,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:08:48,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496763077] [2022-04-27 23:08:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:48,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 23:08:48,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:48,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:48,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:48,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:08:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:08:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:08:48,804 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:08:51,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:08:53,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:08:56,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:00,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:02,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:05,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:15,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:17,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:22,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:22,499 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 23:09:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:09:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 23:09:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 23:09:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 23:09:22,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 23:09:22,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:22,720 INFO L225 Difference]: With dead ends: 72 [2022-04-27 23:09:22,720 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 23:09:22,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:09:22,722 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:22,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 8 Unknown, 0 Unchecked, 24.4s Time] [2022-04-27 23:09:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 23:09:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 23:09:22,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:22,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:22,738 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:22,739 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:22,742 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 23:09:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:22,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:22,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:22,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 23:09:22,743 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 23:09:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:22,746 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 23:09:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:22,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:22,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:22,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:22,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:09:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 23:09:22,749 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 23:09:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:22,750 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 23:09:22,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:09:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 23:09:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:09:22,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:22,750 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:22,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 23:09:22,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:22,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1908885951, now seen corresponding path program 1 times [2022-04-27 23:09:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:22,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435424771] [2022-04-27 23:09:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:22,762 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:22,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092065961] [2022-04-27 23:09:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:22,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:22,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:22,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:09:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:22,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:09:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:22,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:22,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:22,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:22,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:22,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:22,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1179#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:22,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-27 23:09:22,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-27 23:09:22,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:22,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:22,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-27 23:09:22,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: 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] {1138#false} is VALID [2022-04-27 23:09:22,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: 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[] {1138#false} is VALID [2022-04-27 23:09:22,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:22,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:23,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-27 23:09:23,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: 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[] {1138#false} is VALID [2022-04-27 23:09:23,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: 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] {1138#false} is VALID [2022-04-27 23:09:23,115 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-27 23:09:23,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:23,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-27 23:09:23,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 5)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-27 23:09:23,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 5)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1229#(< |main_#t~post5| 5)} is VALID [2022-04-27 23:09:23,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 5)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1233#(< ~counter~0 5)} is VALID [2022-04-27 23:09:23,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 5)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1233#(< ~counter~0 5)} is VALID [2022-04-27 23:09:23,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1233#(< ~counter~0 5)} is VALID [2022-04-27 23:09:23,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 4)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 4)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:23,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:23,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1137#true} is VALID [2022-04-27 23:09:23,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 4)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1137#true} is VALID [2022-04-27 23:09:23,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 4)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 4)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 4)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 4)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1243#(< ~counter~0 4)} is VALID [2022-04-27 23:09:23,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-27 23:09:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:23,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:23,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435424771] [2022-04-27 23:09:23,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:23,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092065961] [2022-04-27 23:09:23,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092065961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:23,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:23,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 23:09:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828227804] [2022-04-27 23:09:23,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 23:09:23,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:23,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:23,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:23,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:09:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:09:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:09:23,152 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:31,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:34,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:36,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:38,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:09:44,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:09:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:50,141 INFO L93 Difference]: Finished difference Result 102 states and 144 transitions. [2022-04-27 23:09:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:09:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 23:09:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 23:09:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 23:09:50,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 23:09:50,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:50,261 INFO L225 Difference]: With dead ends: 102 [2022-04-27 23:09:50,261 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 23:09:50,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:09:50,262 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:50,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 231 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 13.8s Time] [2022-04-27 23:09:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 23:09:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-04-27 23:09:50,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:50,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:09:50,291 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:09:50,292 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:09:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:50,296 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-27 23:09:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-27 23:09:50,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:50,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:50,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 23:09:50,298 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 23:09:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:50,302 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-27 23:09:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-27 23:09:50,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:50,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:50,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:50,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:09:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2022-04-27 23:09:50,306 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 23 [2022-04-27 23:09:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:50,307 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2022-04-27 23:09:50,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2022-04-27 23:09:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:09:50,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:50,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:09:50,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 23:09:50,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:50,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1731080004, now seen corresponding path program 1 times [2022-04-27 23:09:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:50,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714016721] [2022-04-27 23:09:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:50,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:09:50,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754044747] [2022-04-27 23:09:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:50,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:50,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:50,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:09:50,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:09:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:50,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:09:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:50,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:50,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1725#true} is VALID [2022-04-27 23:09:50,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#(<= ~counter~0 0)} {1725#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {1733#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1733#(<= ~counter~0 0)} {1733#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1733#(<= ~counter~0 0)} is VALID [2022-04-27 23:09:50,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1733#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1767#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:50,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {1767#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1767#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:50,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {1767#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1767#(<= ~counter~0 1)} is VALID [2022-04-27 23:09:50,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {1767#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {1777#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {1777#(<= ~counter~0 2)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {1777#(<= ~counter~0 2)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1787#(<= |main_#t~post6| 2)} is VALID [2022-04-27 23:09:50,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#(<= |main_#t~post6| 2)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1726#false} is VALID [2022-04-27 23:09:50,786 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1726#false} is VALID [2022-04-27 23:09:50,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} [129] __VERIFIER_assertENTRY-->L12: 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] {1726#false} is VALID [2022-04-27 23:09:50,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} [132] L12-->L13: 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[] {1726#false} is VALID [2022-04-27 23:09:50,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1726#false} is VALID [2022-04-27 23:09:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:50,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:50,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1726#false} is VALID [2022-04-27 23:09:50,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} [132] L12-->L13: 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[] {1726#false} is VALID [2022-04-27 23:09:50,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} [129] __VERIFIER_assertENTRY-->L12: 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] {1726#false} is VALID [2022-04-27 23:09:50,961 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1726#false} is VALID [2022-04-27 23:09:50,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1815#(< |main_#t~post6| 5)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1726#false} is VALID [2022-04-27 23:09:50,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1819#(< ~counter~0 5)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1815#(< |main_#t~post6| 5)} is VALID [2022-04-27 23:09:50,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {1819#(< ~counter~0 5)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1819#(< ~counter~0 5)} is VALID [2022-04-27 23:09:50,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {1819#(< ~counter~0 5)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1819#(< ~counter~0 5)} is VALID [2022-04-27 23:09:50,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1819#(< ~counter~0 5)} is VALID [2022-04-27 23:09:50,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(< ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1829#(< ~counter~0 4)} is VALID [2022-04-27 23:09:50,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(< ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1829#(< ~counter~0 4)} is VALID [2022-04-27 23:09:50,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {1777#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1829#(< ~counter~0 4)} is VALID [2022-04-27 23:09:50,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {1777#(<= ~counter~0 2)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,965 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1725#true} {1777#(<= ~counter~0 2)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {1725#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1725#true} is VALID [2022-04-27 23:09:50,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {1725#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1725#true} is VALID [2022-04-27 23:09:50,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {1725#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1725#true} is VALID [2022-04-27 23:09:50,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {1777#(<= ~counter~0 2)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1725#true} is VALID [2022-04-27 23:09:50,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#(<= ~counter~0 2)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#(<= ~counter~0 2)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#(<= ~counter~0 2)} {1725#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#(<= ~counter~0 2)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1777#(<= ~counter~0 2)} is VALID [2022-04-27 23:09:50,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1725#true} is VALID [2022-04-27 23:09:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:09:50,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:50,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714016721] [2022-04-27 23:09:50,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:09:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754044747] [2022-04-27 23:09:50,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754044747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:50,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:09:50,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 23:09:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999813909] [2022-04-27 23:09:50,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 23:09:50,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:50,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:51,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:51,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:09:51,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:09:51,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:09:51,001 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:09:58,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:06,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:10,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:13,210 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2022-04-27 23:10:13,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 23:10:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 23:10:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 23:10:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 23:10:13,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-27 23:10:13,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:13,365 INFO L225 Difference]: With dead ends: 127 [2022-04-27 23:10:13,365 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 23:10:13,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:10:13,366 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:13,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 306 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 105 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2022-04-27 23:10:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 23:10:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2022-04-27 23:10:13,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:13,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 104 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 23:10:13,422 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 104 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 23:10:13,422 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 104 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 23:10:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:13,428 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2022-04-27 23:10:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2022-04-27 23:10:13,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:13,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:13,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 111 states. [2022-04-27 23:10:13,429 INFO L87 Difference]: Start difference. First operand has 104 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 111 states. [2022-04-27 23:10:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:13,435 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2022-04-27 23:10:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2022-04-27 23:10:13,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:13,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:13,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:13,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 23:10:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2022-04-27 23:10:13,440 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 24 [2022-04-27 23:10:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:13,441 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2022-04-27 23:10:13,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:10:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2022-04-27 23:10:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:10:13,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:13,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:10:13,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:10:13,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:13,664 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1729947946, now seen corresponding path program 1 times [2022-04-27 23:10:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:13,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016109470] [2022-04-27 23:10:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:10:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:13,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {2461#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2447#true} is VALID [2022-04-27 23:10:13,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {2447#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2447#true} {2447#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:10:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:13,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {2447#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2447#true} is VALID [2022-04-27 23:10:13,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {2447#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2447#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2447#true} {2447#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:13,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {2447#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2461#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:10:13,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {2461#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {2447#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2447#true} {2447#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {2447#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {2447#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {2447#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2447#true} is VALID [2022-04-27 23:10:13,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {2447#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:13,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2447#true} {2447#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:13,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:13,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:13,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:13,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2457#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:13,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {2457#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2457#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:13,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2457#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2457#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 23:10:13,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2457#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2458#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:13,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {2458#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2458#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:13,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {2458#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2458#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 23:10:13,900 INFO L272 TraceCheckUtils]: 20: Hoare triple {2458#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2459#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:10:13,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {2459#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: 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] {2460#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:10:13,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {2460#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: 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[] {2448#false} is VALID [2022-04-27 23:10:13,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {2448#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2448#false} is VALID [2022-04-27 23:10:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:10:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016109470] [2022-04-27 23:10:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016109470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:10:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907834196] [2022-04-27 23:10:13,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:13,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:13,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:10:13,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 23:10:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:13,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 23:10:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:13,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:10:14,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {2447#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {2447#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2447#true} is VALID [2022-04-27 23:10:14,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {2447#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2447#true} {2447#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {2447#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {2447#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2447#true} is VALID [2022-04-27 23:10:14,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {2447#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:14,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2447#true} is VALID [2022-04-27 23:10:14,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {2447#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2447#true} {2447#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:14,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:14,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:14,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:14,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {2456#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2507#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:14,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {2507#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2507#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:14,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {2507#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2507#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:10:14,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {2507#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2517#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 23:10:14,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {2517#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2517#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 23:10:14,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {2517#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2517#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 23:10:14,298 INFO L272 TraceCheckUtils]: 20: Hoare triple {2517#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:14,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: 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] {2531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:14,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {2531#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: 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[] {2448#false} is VALID [2022-04-27 23:10:14,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {2448#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2448#false} is VALID [2022-04-27 23:10:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:10:14,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:10:14,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {2448#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2448#false} is VALID [2022-04-27 23:10:14,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {2531#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: 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[] {2448#false} is VALID [2022-04-27 23:10:14,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: 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] {2531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:14,543 INFO L272 TraceCheckUtils]: 20: Hoare triple {2547#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:14,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {2547#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2547#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:10:14,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {2547#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2547#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:10:14,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2547#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:10:14,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2557#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 23:10:14,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {2557#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2557#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 23:10:14,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2557#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 23:10:14,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2567#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 23:10:14,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {2567#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2567#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 23:10:14,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2567#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 23:10:14,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2447#true} {2447#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:14,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2447#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {2447#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {2447#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {2447#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2447#true} {2447#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2447#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2447#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2447#true} is VALID [2022-04-27 23:10:14,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {2447#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#true} is VALID [2022-04-27 23:10:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:10:14,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907834196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:10:14,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 23:10:14,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 23:10:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424937386] [2022-04-27 23:10:14,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 23:10:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 23:10:14,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:14,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:10:14,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:14,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 23:10:14,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 23:10:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 23:10:14,607 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:10:18,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:20,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:24,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:26,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:34,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:37,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:39,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:41,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:43,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:45,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:48,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:10:55,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:02,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:08,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:09,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:17,368 INFO L93 Difference]: Finished difference Result 160 states and 228 transitions. [2022-04-27 23:11:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 23:11:17,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 23:11:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:11:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:11:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-27 23:11:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:11:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-27 23:11:17,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-27 23:11:18,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:18,048 INFO L225 Difference]: With dead ends: 160 [2022-04-27 23:11:18,048 INFO L226 Difference]: Without dead ends: 145 [2022-04-27 23:11:18,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-27 23:11:18,049 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 162 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:11:18,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 152 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 447 Invalid, 14 Unknown, 0 Unchecked, 42.1s Time] [2022-04-27 23:11:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-27 23:11:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2022-04-27 23:11:18,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:11:18,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 138 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 83 states have internal predecessors, (97), 49 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 23:11:18,126 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 138 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 83 states have internal predecessors, (97), 49 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 23:11:18,127 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 138 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 83 states have internal predecessors, (97), 49 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 23:11:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:18,133 INFO L93 Difference]: Finished difference Result 145 states and 202 transitions. [2022-04-27 23:11:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2022-04-27 23:11:18,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:18,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 83 states have internal predecessors, (97), 49 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 145 states. [2022-04-27 23:11:18,135 INFO L87 Difference]: Start difference. First operand has 138 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 83 states have internal predecessors, (97), 49 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 145 states. [2022-04-27 23:11:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:18,141 INFO L93 Difference]: Finished difference Result 145 states and 202 transitions. [2022-04-27 23:11:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2022-04-27 23:11:18,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:18,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:18,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:11:18,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:11:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 83 states have internal predecessors, (97), 49 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 23:11:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2022-04-27 23:11:18,149 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 24 [2022-04-27 23:11:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:11:18,149 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2022-04-27 23:11:18,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:11:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2022-04-27 23:11:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 23:11:18,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:11:18,150 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:11:18,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 23:11:18,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:18,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:11:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:11:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2026335537, now seen corresponding path program 1 times [2022-04-27 23:11:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:11:18,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482294540] [2022-04-27 23:11:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:11:18,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:11:18,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939920296] [2022-04-27 23:11:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:18,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:18,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:11:18,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:11:18,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 23:11:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:18,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:11:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:18,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:11:18,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {3362#true} is VALID [2022-04-27 23:11:18,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {3362#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3362#true} {3362#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {3362#true} is VALID [2022-04-27 23:11:18,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {3362#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {3362#true} is VALID [2022-04-27 23:11:18,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {3362#true} [129] __VERIFIER_assertENTRY-->L12: 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] {3362#true} is VALID [2022-04-27 23:11:18,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {3362#true} [133] L12-->L12-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[] {3362#true} is VALID [2022-04-27 23:11:18,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {3362#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,779 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3362#true} {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [150] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,779 INFO L272 TraceCheckUtils]: 22: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [134] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {3362#true} is VALID [2022-04-27 23:11:18,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {3362#true} [129] __VERIFIER_assertENTRY-->L12: 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] {3362#true} is VALID [2022-04-27 23:11:18,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {3362#true} [133] L12-->L12-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[] {3362#true} is VALID [2022-04-27 23:11:18,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {3362#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-27 23:11:18,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3362#true} {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:11:18,782 INFO L272 TraceCheckUtils]: 27: Hoare triple {3400#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [139] L40-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* (* v_main_~q~0_18 (* v_main_~n~0_18 .cse0)) 4294967295) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_18 16))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_18, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {3449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:11:18,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {3449#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: 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] {3453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:11:18,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {3453#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: 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[] {3363#false} is VALID [2022-04-27 23:11:18,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {3363#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-27 23:11:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:11:18,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:11:18,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:11:18,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482294540] [2022-04-27 23:11:18,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:11:18,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939920296] [2022-04-27 23:11:18,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939920296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:11:18,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:11:18,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:11:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123984384] [2022-04-27 23:11:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:11:18,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 23:11:18,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:11:18,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:18,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:11:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:11:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:11:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:11:18,823 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:22,565 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2022-04-27 23:11:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:11:22,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 23:11:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:11:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 23:11:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 23:11:22,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 23:11:22,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:22,652 INFO L225 Difference]: With dead ends: 144 [2022-04-27 23:11:22,652 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 23:11:22,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:11:22,653 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 23:11:22,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 23:11:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 23:11:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-27 23:11:22,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:11:22,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:22,722 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:22,725 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:22,733 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-04-27 23:11:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-27 23:11:22,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:22,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:22,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 116 states. [2022-04-27 23:11:22,734 INFO L87 Difference]: Start difference. First operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 116 states. [2022-04-27 23:11:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:22,740 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-04-27 23:11:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-27 23:11:22,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:22,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:22,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:11:22,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:11:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2022-04-27 23:11:22,746 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 31 [2022-04-27 23:11:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:11:22,746 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-04-27 23:11:22,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-27 23:11:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:11:22,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:11:22,749 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:11:22,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 23:11:22,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:22,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:11:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:11:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -266035918, now seen corresponding path program 1 times [2022-04-27 23:11:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:11:22,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179324471] [2022-04-27 23:11:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:11:22,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:11:22,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454560111] [2022-04-27 23:11:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:22,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:22,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:11:22,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:11:22,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 23:11:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:23,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:11:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:23,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:11:23,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {4076#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {4076#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {4076#true} is VALID [2022-04-27 23:11:23,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {4076#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4076#true} {4076#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {4076#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {4076#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {4076#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {4076#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {4076#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {4076#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4076#true} {4076#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4076#true} is VALID [2022-04-27 23:11:23,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {4076#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,327 INFO L272 TraceCheckUtils]: 20: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4076#true} is VALID [2022-04-27 23:11:23,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#true} [129] __VERIFIER_assertENTRY-->L12: 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] {4076#true} is VALID [2022-04-27 23:11:23,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#true} [133] L12-->L12-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[] {4076#true} is VALID [2022-04-27 23:11:23,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {4076#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,328 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4076#true} {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [150] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,328 INFO L272 TraceCheckUtils]: 25: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [134] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {4076#true} is VALID [2022-04-27 23:11:23,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {4076#true} [129] __VERIFIER_assertENTRY-->L12: 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] {4076#true} is VALID [2022-04-27 23:11:23,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {4076#true} [133] L12-->L12-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[] {4076#true} is VALID [2022-04-27 23:11:23,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {4076#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#true} is VALID [2022-04-27 23:11:23,329 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4076#true} {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {4114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:11:23,330 INFO L272 TraceCheckUtils]: 30: Hoare triple {4114#(and (= main_~p~0 0) (= main_~h~0 0))} [139] L40-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* (* v_main_~q~0_18 (* v_main_~n~0_18 .cse0)) 4294967295) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_18 16))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_18, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:11:23,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {4172#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: 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] {4176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:11:23,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {4176#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: 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[] {4077#false} is VALID [2022-04-27 23:11:23,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {4077#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4077#false} is VALID [2022-04-27 23:11:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 23:11:23,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:11:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:11:23,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179324471] [2022-04-27 23:11:23,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:11:23,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454560111] [2022-04-27 23:11:23,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454560111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:11:23,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:11:23,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:11:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464611293] [2022-04-27 23:11:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:11:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 23:11:23,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:11:23,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:23,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:23,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:11:23,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:11:23,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:11:23,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:11:23,366 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:36,984 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2022-04-27 23:11:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:11:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 23:11:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:11:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 23:11:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 23:11:36,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 23:11:37,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:37,083 INFO L225 Difference]: With dead ends: 138 [2022-04-27 23:11:37,083 INFO L226 Difference]: Without dead ends: 134 [2022-04-27 23:11:37,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:11:37,084 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:11:37,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 23:11:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-27 23:11:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-04-27 23:11:37,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:11:37,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:37,154 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:37,154 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:37,159 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-04-27 23:11:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-27 23:11:37,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:37,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:37,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-27 23:11:37,161 INFO L87 Difference]: Start difference. First operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-27 23:11:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:11:37,164 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-04-27 23:11:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-27 23:11:37,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:11:37,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:11:37,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:11:37,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:11:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:11:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2022-04-27 23:11:37,169 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 34 [2022-04-27 23:11:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:11:37,170 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2022-04-27 23:11:37,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:11:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2022-04-27 23:11:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 23:11:37,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:11:37,170 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:11:37,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 23:11:37,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:37,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:11:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:11:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1209382940, now seen corresponding path program 1 times [2022-04-27 23:11:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:11:37,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114168347] [2022-04-27 23:11:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:11:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:11:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:37,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {4856#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {4846#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4846#(<= ~counter~0 0)} {4841#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:11:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:37,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {4841#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4841#true} is VALID [2022-04-27 23:11:37,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {4841#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:37,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {4841#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:37,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4841#true} {4846#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {4841#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4856#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:11:37,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {4856#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {4846#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4846#(<= ~counter~0 0)} {4841#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {4846#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4846#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {4846#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4841#true} is VALID [2022-04-27 23:11:37,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {4841#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4841#true} is VALID [2022-04-27 23:11:37,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {4841#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:37,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4841#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:37,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4841#true} {4846#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {4846#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {4846#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:37,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {4851#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:37,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {4851#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:37,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {4851#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:37,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {4852#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:37,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {4852#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:37,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {4852#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:37,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {4853#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:37,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {4853#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:37,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {4853#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:37,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {4854#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:37,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {4854#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:37,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {4854#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4855#(<= |main_#t~post5| 4)} is VALID [2022-04-27 23:11:37,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {4855#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4842#false} is VALID [2022-04-27 23:11:37,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {4842#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4842#false} is VALID [2022-04-27 23:11:37,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {4842#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4842#false} is VALID [2022-04-27 23:11:37,559 INFO L272 TraceCheckUtils]: 28: Hoare triple {4842#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4842#false} is VALID [2022-04-27 23:11:37,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {4842#false} [129] __VERIFIER_assertENTRY-->L12: 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] {4842#false} is VALID [2022-04-27 23:11:37,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {4842#false} [132] L12-->L13: 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[] {4842#false} is VALID [2022-04-27 23:11:37,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {4842#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-27 23:11:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:11:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:11:37,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114168347] [2022-04-27 23:11:37,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114168347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:11:37,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526583197] [2022-04-27 23:11:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:11:37,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:11:37,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:11:37,564 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:11:37,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 23:11:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:37,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 23:11:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:11:37,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:11:37,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {4841#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:37,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {4841#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {4846#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4846#(<= ~counter~0 0)} {4841#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {4846#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {4846#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {4846#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {4846#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {4846#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {4846#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4846#(<= ~counter~0 0)} {4846#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {4846#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:37,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {4846#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:37,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {4851#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:37,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {4851#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:37,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {4851#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:37,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {4852#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:37,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {4852#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:37,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {4852#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:37,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {4853#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:37,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {4853#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:37,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {4853#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:37,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {4854#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:37,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {4854#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:37,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {4854#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4855#(<= |main_#t~post5| 4)} is VALID [2022-04-27 23:11:37,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {4855#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {4842#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {4842#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L272 TraceCheckUtils]: 28: Hoare triple {4842#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {4842#false} [129] __VERIFIER_assertENTRY-->L12: 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] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {4842#false} [132] L12-->L13: 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[] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {4842#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-27 23:11:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:11:37,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:11:38,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {4842#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-27 23:11:38,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {4842#false} [132] L12-->L13: 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[] {4842#false} is VALID [2022-04-27 23:11:38,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {4842#false} [129] __VERIFIER_assertENTRY-->L12: 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] {4842#false} is VALID [2022-04-27 23:11:38,195 INFO L272 TraceCheckUtils]: 28: Hoare triple {4842#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4842#false} is VALID [2022-04-27 23:11:38,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {4842#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4842#false} is VALID [2022-04-27 23:11:38,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {4842#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4842#false} is VALID [2022-04-27 23:11:38,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {4855#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4842#false} is VALID [2022-04-27 23:11:38,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {4854#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4855#(<= |main_#t~post5| 4)} is VALID [2022-04-27 23:11:38,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {4854#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:38,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {4854#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:38,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {4853#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4854#(<= ~counter~0 4)} is VALID [2022-04-27 23:11:38,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {4853#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:38,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {4853#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:38,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {4852#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4853#(<= ~counter~0 3)} is VALID [2022-04-27 23:11:38,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {4852#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:38,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {4852#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:38,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {4851#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4852#(<= ~counter~0 2)} is VALID [2022-04-27 23:11:38,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {4851#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:38,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {4851#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:38,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {4846#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4851#(<= ~counter~0 1)} is VALID [2022-04-27 23:11:38,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {4846#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4841#true} {4846#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {4841#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:38,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {4841#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:38,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {4841#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4841#true} is VALID [2022-04-27 23:11:38,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {4846#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4841#true} is VALID [2022-04-27 23:11:38,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {4846#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {4846#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4846#(<= ~counter~0 0)} {4841#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {4846#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {4841#true} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {4846#(<= ~counter~0 0)} is VALID [2022-04-27 23:11:38,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {4841#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-27 23:11:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:11:38,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526583197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:11:38,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 23:11:38,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-27 23:11:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086358315] [2022-04-27 23:11:38,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 23:11:38,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-27 23:11:38,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:11:38,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:11:38,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:11:38,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:11:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:11:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:11:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:11:38,245 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:11:42,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:11:44,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:46,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:57,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:11:59,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:01,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:03,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:06,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 23:12:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:12:06,826 INFO L93 Difference]: Finished difference Result 183 states and 231 transitions. [2022-04-27 23:12:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 23:12:06,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-27 23:12:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:12:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:12:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2022-04-27 23:12:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:12:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2022-04-27 23:12:06,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 116 transitions. [2022-04-27 23:12:06,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:12:06,983 INFO L225 Difference]: With dead ends: 183 [2022-04-27 23:12:06,984 INFO L226 Difference]: Without dead ends: 143 [2022-04-27 23:12:06,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-04-27 23:12:06,985 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 25 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2022-04-27 23:12:06,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 120 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 19.9s Time] [2022-04-27 23:12:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-27 23:12:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2022-04-27 23:12:07,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:12:07,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 142 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:12:07,060 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 142 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:12:07,060 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 142 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:12:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:12:07,064 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2022-04-27 23:12:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2022-04-27 23:12:07,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:12:07,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:12:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 143 states. [2022-04-27 23:12:07,066 INFO L87 Difference]: Start difference. First operand has 142 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 143 states. [2022-04-27 23:12:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:12:07,094 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2022-04-27 23:12:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2022-04-27 23:12:07,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:12:07,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:12:07,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:12:07,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:12:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 23:12:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2022-04-27 23:12:07,101 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 32 [2022-04-27 23:12:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:12:07,102 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2022-04-27 23:12:07,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:12:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-04-27 23:12:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 23:12:07,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:12:07,104 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:12:07,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 23:12:07,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 23:12:07,320 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:12:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:12:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash -55903719, now seen corresponding path program 2 times [2022-04-27 23:12:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:12:07,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032908393] [2022-04-27 23:12:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:12:07,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:12:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:12:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:12:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:12:07,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {5829#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {5817#true} is VALID [2022-04-27 23:12:07,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {5817#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5817#true} {5817#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:12:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:12:07,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {5817#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5817#true} is VALID [2022-04-27 23:12:07,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {5817#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {5817#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5817#true} {5817#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {5817#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5829#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:12:07,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {5829#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {5817#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5817#true} {5817#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {5817#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {5817#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {5817#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5817#true} is VALID [2022-04-27 23:12:07,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {5817#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {5817#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {5817#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5817#true} {5817#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {5817#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {5817#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {5817#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {5817#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {5817#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {5817#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {5817#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5817#true} is VALID [2022-04-27 23:12:07,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {5817#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {5817#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {5817#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {5817#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {5817#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {5817#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {5817#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {5817#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5817#true} is VALID [2022-04-27 23:12:07,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {5817#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5817#true} is VALID [2022-04-27 23:12:07,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {5817#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5826#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 23:12:07,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {5826#(<= (+ |main_#t~post5| 1) ~counter~0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5827#(<= 6 ~counter~0)} is VALID [2022-04-27 23:12:07,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {5827#(<= 6 ~counter~0)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5828#(<= 6 |main_#t~post6|)} is VALID [2022-04-27 23:12:07,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {5828#(<= 6 |main_#t~post6|)} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5818#false} is VALID [2022-04-27 23:12:07,418 INFO L272 TraceCheckUtils]: 31: Hoare triple {5818#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {5818#false} is VALID [2022-04-27 23:12:07,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {5818#false} [129] __VERIFIER_assertENTRY-->L12: 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] {5818#false} is VALID [2022-04-27 23:12:07,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {5818#false} [132] L12-->L13: 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[] {5818#false} is VALID [2022-04-27 23:12:07,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {5818#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5818#false} is VALID [2022-04-27 23:12:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-27 23:12:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:12:07,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032908393] [2022-04-27 23:12:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032908393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:12:07,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:12:07,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 23:12:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576525981] [2022-04-27 23:12:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:12:07,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-04-27 23:12:07,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:12:07,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:12:07,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:12:07,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 23:12:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:12:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 23:12:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:12:07,437 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:12:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:12:13,826 INFO L93 Difference]: Finished difference Result 179 states and 225 transitions. [2022-04-27 23:12:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:12:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-04-27 23:12:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:12:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:12:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 23:12:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:12:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 23:12:13,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-27 23:12:13,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:12:13,931 INFO L225 Difference]: With dead ends: 179 [2022-04-27 23:12:13,931 INFO L226 Difference]: Without dead ends: 139 [2022-04-27 23:12:13,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:12:13,932 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 23:12:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 23:12:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-27 23:12:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2022-04-27 23:12:13,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:12:13,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 23:12:14,000 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 23:12:14,000 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 23:12:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:12:14,004 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2022-04-27 23:12:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2022-04-27 23:12:14,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:12:14,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:12:14,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 139 states. [2022-04-27 23:12:14,009 INFO L87 Difference]: Start difference. First operand has 134 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 139 states. [2022-04-27 23:12:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:12:14,012 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2022-04-27 23:12:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2022-04-27 23:12:14,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:12:14,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:12:14,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:12:14,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:12:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 23:12:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 165 transitions. [2022-04-27 23:12:14,017 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 165 transitions. Word has length 35 [2022-04-27 23:12:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:12:14,017 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 165 transitions. [2022-04-27 23:12:14,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 23:12:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-27 23:12:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 23:12:14,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:12:14,019 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:12:14,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 23:12:14,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:12:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:12:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -926681017, now seen corresponding path program 1 times [2022-04-27 23:12:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:12:14,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537565832] [2022-04-27 23:12:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:12:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:12:14,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:12:14,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770431961] [2022-04-27 23:12:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:12:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:12:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:12:14,040 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:12:14,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process