/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/hard-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:42:14,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:42:14,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:42:14,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:42:14,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:42:14,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:42:14,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:42:14,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:42:14,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:42:14,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:42:14,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:42:14,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:42:14,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:42:14,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:42:14,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:42:14,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:42:14,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:42:14,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:42:14,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:42:14,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:42:14,120 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:42:14,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:42:14,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:42:14,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:42:14,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:42:14,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:42:14,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:42:14,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:42:14,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:42:14,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:42:14,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:42:14,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:42:14,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:42:14,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:42:14,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:42:14,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:42:14,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:42:14,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:42:14,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:42:14,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:42:14,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:42:14,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:42:14,143 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 22:42:14,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:42:14,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:42:14,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:42:14,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:42:14,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:42:14,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:42:14,172 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:42:14,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:42:14,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:42:14,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:42:14,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:42:14,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:42:14,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:42:14,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:42:14,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:42:14,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:42:14,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:42:14,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:42:14,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:42:14,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:42:14,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:42:14,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:42:14,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:42:14,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:42:14,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:42:14,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:42:14,176 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:42:14,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:42:14,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:42:14,178 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 22:42:14,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:42:14,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:42:14,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:42:14,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:42:14,414 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:42:14,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-27 22:42:14,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24aae00dd/a4f4fb980c3d40c98e52d8fdb2575f13/FLAG8c6e3f73b [2022-04-27 22:42:14,879 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:42:14,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-27 22:42:14,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24aae00dd/a4f4fb980c3d40c98e52d8fdb2575f13/FLAG8c6e3f73b [2022-04-27 22:42:15,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24aae00dd/a4f4fb980c3d40c98e52d8fdb2575f13 [2022-04-27 22:42:15,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:42:15,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:42:15,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:42:15,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:42:15,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:42:15,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30144013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15, skipping insertion in model container [2022-04-27 22:42:15,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:42:15,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:42:15,485 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/hard-u.c[537,550] [2022-04-27 22:42:15,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:42:15,533 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:42:15,547 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/hard-u.c[537,550] [2022-04-27 22:42:15,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:42:15,576 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:42:15,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15 WrapperNode [2022-04-27 22:42:15,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:42:15,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:42:15,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:42:15,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:42:15,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:42:15,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:42:15,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:42:15,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:42:15,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:42:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:42:15,646 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 22:42:15,659 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 22:42:15,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:42:15,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:42:15,679 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:42:15,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:42:15,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:42:15,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:42:15,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:42:15,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:42:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:42:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:42:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:42:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:42:15,729 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:42:15,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:42:15,895 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:42:15,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:42:15,909 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 22:42:15,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:42:15 BoogieIcfgContainer [2022-04-27 22:42:15,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:42:15,912 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:42:15,912 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:42:15,914 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:42:15,916 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:42:15" (1/1) ... [2022-04-27 22:42:15,918 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:42:15,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:42:15 BasicIcfg [2022-04-27 22:42:15,971 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:42:15,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:42:15,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:42:15,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:42:15,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:42:15" (1/4) ... [2022-04-27 22:42:15,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1715d10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:42:15, skipping insertion in model container [2022-04-27 22:42:15,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:42:15" (2/4) ... [2022-04-27 22:42:15,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1715d10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:42:15, skipping insertion in model container [2022-04-27 22:42:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:42:15" (3/4) ... [2022-04-27 22:42:15,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1715d10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:42:15, skipping insertion in model container [2022-04-27 22:42:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:42:15" (4/4) ... [2022-04-27 22:42:15,978 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u.cqvasr [2022-04-27 22:42:15,994 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:42:15,994 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:42:16,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:42:16,044 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@1e2a57c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b181e81 [2022-04-27 22:42:16,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:42:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 22:42:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:42:16,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:16,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:42:16,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753047, now seen corresponding path program 1 times [2022-04-27 22:42:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:16,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248623384] [2022-04-27 22:42:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:42:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:16,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 22:42:16,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 22:42:16,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 22:42:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:42:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:16,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [105] assume_abort_if_notENTRY-->L12: 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] {38#true} is VALID [2022-04-27 22:42:16,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 22:42:16,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 22:42:16,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {39#false} is VALID [2022-04-27 22:42:16,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:42:16,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 22:42:16,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 22:42:16,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 22:42:16,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 22:42:16,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {38#true} is VALID [2022-04-27 22:42:16,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#true} is VALID [2022-04-27 22:42:16,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} [105] assume_abort_if_notENTRY-->L12: 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] {38#true} is VALID [2022-04-27 22:42:16,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 22:42:16,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 22:42:16,287 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {39#false} is VALID [2022-04-27 22:42:16,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {39#false} is VALID [2022-04-27 22:42:16,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 22:42:16,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {39#false} is VALID [2022-04-27 22:42:16,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} [119] __VERIFIER_assertENTRY-->L15: 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] {39#false} is VALID [2022-04-27 22:42:16,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} [123] L15-->L16: 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[] {39#false} is VALID [2022-04-27 22:42:16,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 22:42:16,291 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 22:42:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:42:16,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248623384] [2022-04-27 22:42:16,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248623384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:42:16,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:42:16,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:42:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056303685] [2022-04-27 22:42:16,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:42:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-27 22:42:16,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:42:16,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22:42:16,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:16,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:42:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:42:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:42:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:42:16,364 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22:42:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:16,566 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-27 22:42:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:42:16,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-27 22:42:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:42:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22:42:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 22:42:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22:42:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 22:42:16,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 22:42:16,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:16,739 INFO L225 Difference]: With dead ends: 61 [2022-04-27 22:42:16,739 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 22:42:16,742 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 22:42:16,746 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:42:16,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:42:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 22:42:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 22:42:16,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:42:16,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:16,779 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:16,780 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:16,784 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 22:42:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 22:42:16,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:16,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:16,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-27 22:42:16,786 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-27 22:42:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:16,789 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 22:42:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 22:42:16,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:16,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:16,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:42:16,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:42:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-27 22:42:16,795 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-27 22:42:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:42:16,795 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-27 22:42:16,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22:42:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 22:42:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:42:16,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:16,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:42:16,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:42:16,797 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 861759786, now seen corresponding path program 1 times [2022-04-27 22:42:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:16,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464717760] [2022-04-27 22:42:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:42:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:16,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {240#true} is VALID [2022-04-27 22:42:16,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:42:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:16,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} [105] assume_abort_if_notENTRY-->L12: 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] {240#true} is VALID [2022-04-27 22:42:16,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [110] L12-->L12-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[] {240#true} is VALID [2022-04-27 22:42:16,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {240#true} is VALID [2022-04-27 22:42:16,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:42:16,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {240#true} is VALID [2022-04-27 22:42:16,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {240#true} is VALID [2022-04-27 22:42:16,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {240#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {240#true} is VALID [2022-04-27 22:42:16,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} [105] assume_abort_if_notENTRY-->L12: 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] {240#true} is VALID [2022-04-27 22:42:16,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} [110] L12-->L12-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[] {240#true} is VALID [2022-04-27 22:42:16,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-27 22:42:16,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {240#true} {240#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {240#true} is VALID [2022-04-27 22:42:16,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {249#(= main_~q~0 0)} is VALID [2022-04-27 22:42:16,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(= main_~q~0 0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#(= main_~q~0 0)} is VALID [2022-04-27 22:42:16,921 INFO L272 TraceCheckUtils]: 13: Hoare triple {249#(= main_~q~0 0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {250#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:42:16,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {250#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {251#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:42:16,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(not (= __VERIFIER_assert_~cond 0))} [123] L15-->L16: 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[] {241#false} is VALID [2022-04-27 22:42:16,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {241#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-27 22:42:16,922 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 22:42:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:42:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464717760] [2022-04-27 22:42:16,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464717760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:42:16,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:42:16,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:42:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303966614] [2022-04-27 22:42:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:42:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 22:42:16,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:42:16,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 22:42:16,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:16,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:42:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:42:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:42:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:42:16,951 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 22:42:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:17,400 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-27 22:42:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:42:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 22:42:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:42:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 22:42:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 22:42:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 22:42:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 22:42:17,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 22:42:17,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:17,502 INFO L225 Difference]: With dead ends: 43 [2022-04-27 22:42:17,503 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 22:42:17,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:42:17,505 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:42:17,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:42:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 22:42:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-27 22:42:17,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:42:17,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:17,518 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:17,519 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:17,527 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 22:42:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 22:42:17,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:17,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:17,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-27 22:42:17,536 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-27 22:42:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:17,543 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 22:42:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 22:42:17,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:17,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:17,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:42:17,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:42:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-27 22:42:17,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-27 22:42:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:42:17,546 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-27 22:42:17,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 22:42:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 22:42:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 22:42:17,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:17,547 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] [2022-04-27 22:42:17,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:42:17,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash 325569287, now seen corresponding path program 1 times [2022-04-27 22:42:17,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:17,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020788604] [2022-04-27 22:42:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:17,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:42:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:17,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-27 22:42:17,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:42:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:17,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [105] assume_abort_if_notENTRY-->L12: 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] {458#true} is VALID [2022-04-27 22:42:17,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [110] L12-->L12-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[] {458#true} is VALID [2022-04-27 22:42:17,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {458#true} is VALID [2022-04-27 22:42:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 22:42:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:17,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [119] __VERIFIER_assertENTRY-->L15: 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] {458#true} is VALID [2022-04-27 22:42:17,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [124] L15-->L15-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[] {458#true} is VALID [2022-04-27 22:42:17,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 22:42:17,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:42:17,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-27 22:42:17,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {458#true} is VALID [2022-04-27 22:42:17,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {458#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {458#true} is VALID [2022-04-27 22:42:17,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} [105] assume_abort_if_notENTRY-->L12: 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] {458#true} is VALID [2022-04-27 22:42:17,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} [110] L12-->L12-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[] {458#true} is VALID [2022-04-27 22:42:17,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {458#true} {458#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {458#true} is VALID [2022-04-27 22:42:17,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 22:42:17,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 22:42:17,650 INFO L272 TraceCheckUtils]: 13: Hoare triple {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {458#true} is VALID [2022-04-27 22:42:17,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} [119] __VERIFIER_assertENTRY-->L15: 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] {458#true} is VALID [2022-04-27 22:42:17,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} [124] L15-->L15-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[] {458#true} is VALID [2022-04-27 22:42:17,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-27 22:42:17,651 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 22:42:17,652 INFO L272 TraceCheckUtils]: 18: Hoare triple {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:42:17,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __VERIFIER_assertENTRY-->L15: 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] {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:42:17,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} [123] L15-->L16: 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[] {459#false} is VALID [2022-04-27 22:42:17,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-27 22:42:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:42:17,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:42:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020788604] [2022-04-27 22:42:17,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020788604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:42:17,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:42:17,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:42:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703794549] [2022-04-27 22:42:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:42:17,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 22:42:17,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:42:17,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:42:17,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:17,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:42:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:42:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:42:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:42:17,681 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:42:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:18,082 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 22:42:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:42:18,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 22:42:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:42:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:42:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 22:42:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:42:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 22:42:18,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 22:42:18,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:18,148 INFO L225 Difference]: With dead ends: 47 [2022-04-27 22:42:18,148 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 22:42:18,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:42:18,150 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:42:18,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:42:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 22:42:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-27 22:42:18,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:42:18,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:18,157 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:18,158 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:18,160 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 22:42:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 22:42:18,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:18,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:18,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 22:42:18,161 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 22:42:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:18,163 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 22:42:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 22:42:18,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:18,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:18,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:42:18,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:42:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 22:42:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 22:42:18,165 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-27 22:42:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:42:18,166 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 22:42:18,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:42:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 22:42:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 22:42:18,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:18,167 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] [2022-04-27 22:42:18,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 22:42:18,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1461652409, now seen corresponding path program 1 times [2022-04-27 22:42:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:18,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237106749] [2022-04-27 22:42:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:18,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:42:18,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260802029] [2022-04-27 22:42:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:18,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:18,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:42:18,184 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 22:42:18,194 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 22:42:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:18,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 22:42:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:18,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:42:18,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-27 22:42:18,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {698#true} is VALID [2022-04-27 22:42:18,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {698#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-27 22:42:18,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {698#true} {698#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-27 22:42:18,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {698#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-27 22:42:18,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {698#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {698#true} is VALID [2022-04-27 22:42:18,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {698#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {698#true} is VALID [2022-04-27 22:42:18,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#true} [105] assume_abort_if_notENTRY-->L12: 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] {724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:42:18,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [110] L12-->L12-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[] {728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:42:18,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {728#(not (= |assume_abort_if_not_#in~cond| 0))} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:42:18,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {728#(not (= |assume_abort_if_not_#in~cond| 0))} {698#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {735#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 22:42:18,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {735#(<= 1 (mod main_~B~0 4294967296))} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:18,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:18,977 INFO L272 TraceCheckUtils]: 13: Hoare triple {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {698#true} is VALID [2022-04-27 22:42:18,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#true} [119] __VERIFIER_assertENTRY-->L15: 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] {698#true} is VALID [2022-04-27 22:42:18,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#true} [124] L15-->L15-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[] {698#true} is VALID [2022-04-27 22:42:18,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {698#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-27 22:42:18,979 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {698#true} {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:18,979 INFO L272 TraceCheckUtils]: 18: Hoare triple {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {698#true} is VALID [2022-04-27 22:42:18,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#true} [119] __VERIFIER_assertENTRY-->L15: 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] {698#true} is VALID [2022-04-27 22:42:18,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#true} [124] L15-->L15-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[] {698#true} is VALID [2022-04-27 22:42:18,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {698#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#true} is VALID [2022-04-27 22:42:18,984 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {698#true} {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:18,985 INFO L272 TraceCheckUtils]: 23: Hoare triple {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:42:18,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __VERIFIER_assertENTRY-->L15: 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] {780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:42:18,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {780#(<= 1 __VERIFIER_assert_~cond)} [123] L15-->L16: 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[] {699#false} is VALID [2022-04-27 22:42:18,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {699#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {699#false} is VALID [2022-04-27 22:42:18,987 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 22:42:18,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:42:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:42:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237106749] [2022-04-27 22:42:18,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:42:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260802029] [2022-04-27 22:42:18,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260802029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:42:18,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:42:18,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 22:42:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061358200] [2022-04-27 22:42:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:42:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 22:42:18,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:42:18,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:42:19,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:19,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:42:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:42:19,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:42:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:42:19,022 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:42:21,355 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 22:42:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:21,741 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2022-04-27 22:42:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 22:42:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 22:42:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:42:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:42:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-27 22:42:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:42:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-27 22:42:21,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2022-04-27 22:42:21,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:21,835 INFO L225 Difference]: With dead ends: 61 [2022-04-27 22:42:21,835 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 22:42:21,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:42:21,836 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:42:21,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 204 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 22:42:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 22:42:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-27 22:42:21,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:42:21,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 22:42:21,854 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 22:42:21,854 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 22:42:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:21,857 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 22:42:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-04-27 22:42:21,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:21,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:21,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 22:42:21,859 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 58 states. [2022-04-27 22:42:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:21,861 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 22:42:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-04-27 22:42:21,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:21,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:21,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:42:21,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:42:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 22:42:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-04-27 22:42:21,864 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2022-04-27 22:42:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:42:21,864 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-04-27 22:42:21,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:42:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-27 22:42:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 22:42:21,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:21,865 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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 22:42:21,889 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 22:42:22,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:22,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1008917278, now seen corresponding path program 1 times [2022-04-27 22:42:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:22,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973702786] [2022-04-27 22:42:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:22,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:42:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061439324] [2022-04-27 22:42:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:22,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:22,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:42:22,103 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 22:42:22,126 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 22:42:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:22,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 22:42:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:22,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:42:22,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1074#true} is VALID [2022-04-27 22:42:22,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#true} [105] assume_abort_if_notENTRY-->L12: 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] {1074#true} is VALID [2022-04-27 22:42:22,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#true} [110] L12-->L12-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[] {1074#true} is VALID [2022-04-27 22:42:22,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#true} {1074#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1074#true} is VALID [2022-04-27 22:42:22,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1074#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 22:42:22,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 22:42:22,775 INFO L272 TraceCheckUtils]: 13: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1074#true} is VALID [2022-04-27 22:42:22,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1074#true} is VALID [2022-04-27 22:42:22,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {1074#true} [124] L15-->L15-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[] {1074#true} is VALID [2022-04-27 22:42:22,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,784 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1074#true} {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 22:42:22,784 INFO L272 TraceCheckUtils]: 18: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1074#true} is VALID [2022-04-27 22:42:22,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {1074#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1074#true} is VALID [2022-04-27 22:42:22,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#true} [124] L15-->L15-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[] {1074#true} is VALID [2022-04-27 22:42:22,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {1074#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,788 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1074#true} {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 22:42:22,788 INFO L272 TraceCheckUtils]: 23: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1074#true} is VALID [2022-04-27 22:42:22,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {1074#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1074#true} is VALID [2022-04-27 22:42:22,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {1074#true} [124] L15-->L15-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[] {1074#true} is VALID [2022-04-27 22:42:22,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {1074#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#true} is VALID [2022-04-27 22:42:22,790 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1074#true} {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 22:42:22,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [128] L37-->L52-2: Formula: (not (<= (mod v_main_~d~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1164#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 22:42:22,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {1164#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1164#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 22:42:22,793 INFO L272 TraceCheckUtils]: 30: Hoare triple {1164#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [117] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1171#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:42:22,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {1171#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __VERIFIER_assertENTRY-->L15: 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] {1175#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:42:22,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {1175#(<= 1 __VERIFIER_assert_~cond)} [123] L15-->L16: 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[] {1075#false} is VALID [2022-04-27 22:42:22,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {1075#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1075#false} is VALID [2022-04-27 22:42:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 22:42:22,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:42:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:42:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973702786] [2022-04-27 22:42:22,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:42:22,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061439324] [2022-04-27 22:42:22,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061439324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:42:22,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:42:22,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:42:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709437891] [2022-04-27 22:42:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:42:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 22:42:22,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:42:22,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:42:22,819 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 22:42:22,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:42:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:42:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:42:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:42:22,820 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:42:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:27,498 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 22:42:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:42:27,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 22:42:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:42:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:42:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-27 22:42:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:42:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-27 22:42:27,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-27 22:42:27,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:27,799 INFO L225 Difference]: With dead ends: 73 [2022-04-27 22:42:27,799 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 22:42:27,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:42:27,800 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 22:42:27,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 22:42:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 22:42:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-27 22:42:27,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:42:27,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 22:42:27,837 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 22:42:27,839 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 22:42:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:27,845 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 22:42:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 22:42:27,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:27,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:27,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-27 22:42:27,847 INFO L87 Difference]: Start difference. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-27 22:42:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:27,852 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 22:42:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 22:42:27,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:27,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:27,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:42:27,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:42:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 22:42:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-27 22:42:27,856 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 34 [2022-04-27 22:42:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:42:27,856 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-27 22:42:27,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:42:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-27 22:42:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 22:42:27,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:27,859 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:42:27,884 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 22:42:28,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:28,076 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1762200840, now seen corresponding path program 1 times [2022-04-27 22:42:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256271763] [2022-04-27 22:42:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:28,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:42:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423957695] [2022-04-27 22:42:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:28,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:28,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:42:28,107 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 22:42:28,109 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 22:42:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:28,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 22:42:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:42:28,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:42:28,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1529#true} is VALID [2022-04-27 22:42:28,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1529#true} is VALID [2022-04-27 22:42:28,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1529#true} is VALID [2022-04-27 22:42:28,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#true} [105] assume_abort_if_notENTRY-->L12: 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] {1529#true} is VALID [2022-04-27 22:42:28,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#true} [110] L12-->L12-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[] {1529#true} is VALID [2022-04-27 22:42:28,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#true} {1529#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1529#true} is VALID [2022-04-27 22:42:28,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1529#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:28,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:28,446 INFO L272 TraceCheckUtils]: 13: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1529#true} is VALID [2022-04-27 22:42:28,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:28,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:28,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,447 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1529#true} {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:28,447 INFO L272 TraceCheckUtils]: 18: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1529#true} is VALID [2022-04-27 22:42:28,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:28,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:28,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,448 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1529#true} {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:28,448 INFO L272 TraceCheckUtils]: 23: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1529#true} is VALID [2022-04-27 22:42:28,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:28,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:28,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,449 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1529#true} {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 22:42:28,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (<= (mod v_main_~d~0_13 4294967296) (mod v_main_~r~0_10 4294967296)) (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 22:42:28,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 22:42:28,450 INFO L272 TraceCheckUtils]: 30: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1529#true} is VALID [2022-04-27 22:42:28,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:28,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:28,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,451 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1529#true} {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 22:42:28,452 INFO L272 TraceCheckUtils]: 35: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1529#true} is VALID [2022-04-27 22:42:28,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:28,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:28,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:28,454 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1529#true} {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 22:42:28,456 INFO L272 TraceCheckUtils]: 40: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:42:28,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __VERIFIER_assertENTRY-->L15: 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] {1660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:42:28,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {1660#(<= 1 __VERIFIER_assert_~cond)} [123] L15-->L16: 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[] {1530#false} is VALID [2022-04-27 22:42:28,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {1530#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#false} is VALID [2022-04-27 22:42:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 22:42:28,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:42:29,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {1530#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#false} is VALID [2022-04-27 22:42:29,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {1660#(<= 1 __VERIFIER_assert_~cond)} [123] L15-->L16: 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[] {1530#false} is VALID [2022-04-27 22:42:29,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __VERIFIER_assertENTRY-->L15: 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] {1660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:42:29,345 INFO L272 TraceCheckUtils]: 40: Hoare triple {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:42:29,345 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1529#true} {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 22:42:29,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:29,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:29,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:29,346 INFO L272 TraceCheckUtils]: 35: Hoare triple {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1529#true} is VALID [2022-04-27 22:42:29,346 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1529#true} {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 22:42:29,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:29,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:29,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:29,347 INFO L272 TraceCheckUtils]: 30: Hoare triple {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1529#true} is VALID [2022-04-27 22:42:29,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 22:42:31,364 WARN L290 TraceCheckUtils]: 28: Hoare triple {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [129] L37-->L34-2: Formula: (and (<= (mod v_main_~d~0_13 4294967296) (mod v_main_~r~0_10 4294967296)) (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 22:42:31,365 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1529#true} {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [140] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 22:42:31,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:31,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:31,366 INFO L272 TraceCheckUtils]: 23: Hoare triple {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [122] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1529#true} is VALID [2022-04-27 22:42:31,367 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1529#true} {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [139] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 22:42:31,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:31,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:31,367 INFO L272 TraceCheckUtils]: 18: Hoare triple {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [118] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1529#true} is VALID [2022-04-27 22:42:31,368 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1529#true} {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [138] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 22:42:31,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#true} [124] L15-->L15-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[] {1529#true} is VALID [2022-04-27 22:42:31,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#true} [119] __VERIFIER_assertENTRY-->L15: 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] {1529#true} is VALID [2022-04-27 22:42:31,368 INFO L272 TraceCheckUtils]: 13: Hoare triple {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [114] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1529#true} is VALID [2022-04-27 22:42:31,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 22:42:31,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1529#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 22:42:31,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#true} {1529#true} [137] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#true} [110] L12-->L12-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[] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#true} [105] assume_abort_if_notENTRY-->L12: 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] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#true} [103] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1529#true} is VALID [2022-04-27 22:42:31,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1529#true} is VALID [2022-04-27 22:42:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 22:42:31,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:42:31,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256271763] [2022-04-27 22:42:31,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:42:31,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423957695] [2022-04-27 22:42:31,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423957695] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:42:31,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:42:31,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 22:42:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705703650] [2022-04-27 22:42:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:42:31,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 22:42:31,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:42:31,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:42:32,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:32,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:42:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:42:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:42:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:42:32,608 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:42:37,917 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 22:42:40,126 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 22:42:42,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:42:44,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:42:48,153 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 22:42:50,272 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 22:42:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:50,571 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-04-27 22:42:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:42:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 22:42:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:42:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:42:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 22:42:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:42:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 22:42:50,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 22:42:52,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:42:52,650 INFO L225 Difference]: With dead ends: 81 [2022-04-27 22:42:52,650 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 22:42:52,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:42:52,651 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-04-27 22:42:52,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 6 Unknown, 0 Unchecked, 13.3s Time] [2022-04-27 22:42:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 22:42:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-27 22:42:52,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:42:52,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 22:42:52,687 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 22:42:52,687 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 22:42:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:52,691 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 22:42:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 22:42:52,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:52,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:52,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-27 22:42:52,692 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-27 22:42:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:42:52,695 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 22:42:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 22:42:52,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:42:52,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:42:52,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:42:52,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:42:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 22:42:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-27 22:42:52,699 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 44 [2022-04-27 22:42:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:42:52,699 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-27 22:42:52,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:42:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-27 22:42:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 22:42:52,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:42:52,700 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:42:52,704 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 22:42:52,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:52,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:42:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:42:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 582060793, now seen corresponding path program 1 times [2022-04-27 22:42:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:42:52,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509772800] [2022-04-27 22:42:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:42:52,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:42:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753164767] [2022-04-27 22:42:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:42:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:42:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:42:52,917 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 22:42:52,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process