/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 02:07:31,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:07:31,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:07:31,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:07:31,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:07:31,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:07:31,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:07:31,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:07:31,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:07:31,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:07:31,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:07:31,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:07:31,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:07:31,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:07:31,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:07:31,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:07:31,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:07:31,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:07:31,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:07:31,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:07:31,988 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:07:31,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:07:31,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:07:31,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:07:31,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:07:32,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:07:32,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:07:32,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:07:32,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:07:32,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:07:32,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:07:32,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:07:32,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:07:32,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:07:32,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:07:32,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:07:32,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:07:32,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:07:32,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:07:32,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:07:32,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:07:32,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:07:32,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:07:32,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:07:32,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:07:32,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:07:32,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:07:32,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:07:32,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:07:32,041 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:07:32,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:07:32,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:07:32,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:07:32,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:07:32,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:07:32,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:07:32,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:07:32,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:07:32,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:07:32,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:07:32,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:07:32,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:07:32,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:07:32,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:07:32,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:07:32,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:07:32,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:07:32,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:07:32,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:07:32,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:07:32,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:07:32,047 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:07:32,047 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 02:07:32,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:07:32,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:07:32,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:07:32,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:07:32,265 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:07:32,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-15 02:07:32,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36b23c1e/6e66b844bb204528a2d145b3717f68da/FLAG94dcbc032 [2022-04-15 02:07:32,649 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:07:32,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-15 02:07:32,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36b23c1e/6e66b844bb204528a2d145b3717f68da/FLAG94dcbc032 [2022-04-15 02:07:33,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36b23c1e/6e66b844bb204528a2d145b3717f68da [2022-04-15 02:07:33,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:07:33,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:07:33,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:07:33,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:07:33,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:07:33,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2142bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33, skipping insertion in model container [2022-04-15 02:07:33,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:07:33,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:07:33,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c[525,538] [2022-04-15 02:07:33,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:07:33,241 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:07:33,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c[525,538] [2022-04-15 02:07:33,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:07:33,275 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:07:33,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33 WrapperNode [2022-04-15 02:07:33,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:07:33,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:07:33,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:07:33,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:07:33,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:07:33,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:07:33,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:07:33,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:07:33,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:07:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:33,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 02:07:33,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 02:07:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:07:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:07:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:07:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:07:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:07:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:07:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:07:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:07:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:07:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:07:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:07:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:07:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:07:33,387 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:07:33,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:07:33,582 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:07:33,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:07:33,587 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 02:07:33,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:07:33 BoogieIcfgContainer [2022-04-15 02:07:33,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:07:33,597 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:07:33,597 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:07:33,610 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:07:33,612 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:07:33" (1/1) ... [2022-04-15 02:07:33,613 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:07:33,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:07:33 BasicIcfg [2022-04-15 02:07:33,646 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:07:33,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:07:33,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:07:33,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:07:33,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:07:33" (1/4) ... [2022-04-15 02:07:33,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34063719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:07:33, skipping insertion in model container [2022-04-15 02:07:33,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:07:33" (2/4) ... [2022-04-15 02:07:33,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34063719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:07:33, skipping insertion in model container [2022-04-15 02:07:33,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:07:33" (3/4) ... [2022-04-15 02:07:33,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34063719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:07:33, skipping insertion in model container [2022-04-15 02:07:33,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:07:33" (4/4) ... [2022-04-15 02:07:33,664 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.cqvasr [2022-04-15 02:07:33,667 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:07:33,667 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:07:33,706 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:07:33,714 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 02:07:33,714 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:07:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 02:07:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 02:07:33,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:33,735 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:07:33,735 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash -460462115, now seen corresponding path program 1 times [2022-04-15 02:07:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:33,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244008417] [2022-04-15 02:07:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:07:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:33,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-15 02:07:33,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 02:07:33,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 02:07:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:07:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:33,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-15 02:07:33,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-15 02:07:33,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:07:33,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-15 02:07:33,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 02:07:33,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 02:07:33,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 02:07:33,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#true} is VALID [2022-04-15 02:07:33,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-15 02:07:33,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-15 02:07:33,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-15 02:07:33,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-15 02:07:33,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} [114] L30-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} [118] L52-2-->L38-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,934 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {43#false} is VALID [2022-04-15 02:07:33,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-15 02:07:33,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 02:07:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:07:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:33,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244008417] [2022-04-15 02:07:33,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244008417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:33,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:33,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:07:33,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849587817] [2022-04-15 02:07:33,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 02:07:33,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:33,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:07:33,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:07:33,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:07:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:07:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:07:33,992 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:07:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:34,977 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-15 02:07:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:07:34,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 02:07:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:07:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-15 02:07:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:07:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-15 02:07:35,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-15 02:07:35,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:07:35,159 INFO L225 Difference]: With dead ends: 70 [2022-04-15 02:07:35,159 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 02:07:35,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:07:35,164 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 02:07:35,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 02:07:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 02:07:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 02:07:35,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:35,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:35,189 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:35,190 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:35,193 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 02:07:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 02:07:35,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:35,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:35,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 02:07:35,194 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 02:07:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:35,197 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 02:07:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 02:07:35,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:35,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:35,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:35,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-15 02:07:35,201 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-15 02:07:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:35,202 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-15 02:07:35,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:07:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-15 02:07:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 02:07:35,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:35,203 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:07:35,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:07:35,203 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -889932734, now seen corresponding path program 1 times [2022-04-15 02:07:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879544533] [2022-04-15 02:07:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:35,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:35,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:35,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024348197] [2022-04-15 02:07:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:35,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:07:35,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 02:07:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:35,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 02:07:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:35,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:35,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-15 02:07:35,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {282#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:35,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {316#(<= |main_#t~post5| 0)} is VALID [2022-04-15 02:07:35,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {275#false} is VALID [2022-04-15 02:07:35,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {275#false} is VALID [2022-04-15 02:07:35,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {275#false} is VALID [2022-04-15 02:07:35,420 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {275#false} is VALID [2022-04-15 02:07:35,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {275#false} is VALID [2022-04-15 02:07:35,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-15 02:07:35,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-15 02:07:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:07:35,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:07:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:35,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879544533] [2022-04-15 02:07:35,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:35,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024348197] [2022-04-15 02:07:35,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024348197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:35,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:35,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 02:07:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082181803] [2022-04-15 02:07:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 02:07:35,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:35,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:07:35,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:07:35,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 02:07:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 02:07:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 02:07:35,446 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:07:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:49,160 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-15 02:07:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 02:07:49,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 02:07:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:07:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:07:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 02:07:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:07:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 02:07:49,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-15 02:07:49,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:07:49,241 INFO L225 Difference]: With dead ends: 55 [2022-04-15 02:07:49,241 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 02:07:49,242 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 02:07:49,242 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:07:49,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:07:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 02:07:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 02:07:49,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:07:49,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:49,265 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:49,265 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:49,267 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 02:07:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 02:07:49,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:49,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:49,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 02:07:49,268 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 02:07:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:07:49,270 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 02:07:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 02:07:49,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:07:49,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:07:49,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:07:49,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:07:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:07:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-15 02:07:49,273 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-15 02:07:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:07:49,273 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-15 02:07:49,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:07:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 02:07:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 02:07:49,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:07:49,274 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:07:49,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 02:07:49,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:49,493 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:07:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:07:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1699853977, now seen corresponding path program 1 times [2022-04-15 02:07:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:07:49,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457156842] [2022-04-15 02:07:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:07:49,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:07:49,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517372340] [2022-04-15 02:07:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:07:49,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:07:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:07:49,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:07:49,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 02:07:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:49,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 02:07:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:07:49,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:07:49,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#true} is VALID [2022-04-15 02:07:49,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {554#(<= ~counter~0 0)} is VALID [2022-04-15 02:07:49,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-15 02:07:49,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {588#(<= ~counter~0 1)} is VALID [2022-04-15 02:07:49,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {588#(<= ~counter~0 1)} is VALID [2022-04-15 02:07:49,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {598#(<= |main_#t~post6| 1)} is VALID [2022-04-15 02:07:49,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {547#false} is VALID [2022-04-15 02:07:49,739 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {547#false} is VALID [2022-04-15 02:07:49,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {547#false} is VALID [2022-04-15 02:07:49,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-15 02:07:49,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#false} is VALID [2022-04-15 02:07:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:07:49,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:07:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:07:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457156842] [2022-04-15 02:07:49,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:07:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517372340] [2022-04-15 02:07:49,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517372340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:07:49,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:07:49,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:07:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689982951] [2022-04-15 02:07:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:07:49,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 02:07:49,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:07:49,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:07:49,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:07:49,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:07:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:07:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:07:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:07:49,759 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:08:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:08:01,661 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-15 02:08:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:08:01,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 02:08:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:08:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:08:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 02:08:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:08:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 02:08:01,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 02:08:01,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:08:01,719 INFO L225 Difference]: With dead ends: 49 [2022-04-15 02:08:01,719 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 02:08:01,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:08:01,720 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:08:01,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:08:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 02:08:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 02:08:01,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:08:01,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:08:01,727 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:08:01,727 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:08:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:08:01,729 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 02:08:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-15 02:08:01,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:08:01,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:08:01,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-15 02:08:01,730 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-15 02:08:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:08:01,732 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 02:08:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-15 02:08:01,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:08:01,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:08:01,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:08:01,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:08:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 02:08:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-15 02:08:01,737 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-15 02:08:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:08:01,738 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-15 02:08:01,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 02:08:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-15 02:08:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 02:08:01,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:08:01,739 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:08:01,766 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-15 02:08:01,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 02:08:01,952 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:08:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:08:01,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1700986035, now seen corresponding path program 1 times [2022-04-15 02:08:01,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:08:01,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724870670] [2022-04-15 02:08:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:08:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:08:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:08:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:08:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:08:02,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {822#true} is VALID [2022-04-15 02:08:02,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:08:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:08:02,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-15 02:08:02,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-15 02:08:02,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:08:02,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {822#true} is VALID [2022-04-15 02:08:02,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {822#true} is VALID [2022-04-15 02:08:02,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-15 02:08:02,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {822#true} is VALID [2022-04-15 02:08:02,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {822#true} is VALID [2022-04-15 02:08:02,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {822#true} is VALID [2022-04-15 02:08:02,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 02:08:02,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 02:08:02,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 02:08:02,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 02:08:02,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 02:08:02,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 02:08:02,199 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:08:02,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:08:02,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-15 02:08:02,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {823#false} is VALID [2022-04-15 02:08:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:08:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:08:02,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724870670] [2022-04-15 02:08:02,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724870670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:08:02,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:08:02,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 02:08:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004639278] [2022-04-15 02:08:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:08:02,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 02:08:02,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:08:02,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:08:02,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:08:02,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 02:08:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:08:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 02:08:02,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 02:08:02,220 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:08:08,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:08:11,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:08:14,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:08:16,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:08:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:08:25,098 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-15 02:08:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:08:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 02:08:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:08:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:08:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-15 02:08:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:08:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-15 02:08:25,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-15 02:08:25,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:08:25,330 INFO L225 Difference]: With dead ends: 72 [2022-04-15 02:08:25,331 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 02:08:25,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:08:25,332 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:08:25,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 205 Invalid, 4 Unknown, 0 Unchecked, 14.2s Time] [2022-04-15 02:08:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 02:08:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 02:08:25,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:08:25,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:08:25,353 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:08:25,353 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:08:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:08:25,355 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 02:08:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-15 02:08:25,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:08:25,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:08:25,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-15 02:08:25,360 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-15 02:08:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:08:25,362 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 02:08:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-15 02:08:25,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:08:25,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:08:25,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:08:25,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:08:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:08:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-15 02:08:25,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-15 02:08:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:08:25,365 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-15 02:08:25,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:08:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-15 02:08:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 02:08:25,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:08:25,365 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:08:25,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 02:08:25,366 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:08:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:08:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1908885951, now seen corresponding path program 1 times [2022-04-15 02:08:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:08:25,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893903692] [2022-04-15 02:08:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:08:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:08:25,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:08:25,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292051950] [2022-04-15 02:08:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:08:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:08:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:08:25,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:08:25,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 02:08:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:08:25,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 02:08:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:08:25,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:08:25,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-15 02:08:25,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1145#(<= ~counter~0 0)} is VALID [2022-04-15 02:08:25,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-15 02:08:25,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1179#(<= ~counter~0 1)} is VALID [2022-04-15 02:08:25,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1179#(<= ~counter~0 1)} is VALID [2022-04-15 02:08:25,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-15 02:08:25,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-15 02:08:25,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-15 02:08:25,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-15 02:08:25,546 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-15 02:08:25,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1138#false} is VALID [2022-04-15 02:08:25,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-15 02:08:25,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-15 02:08:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:08:25,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:08:25,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-15 02:08:25,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-15 02:08:25,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1138#false} is VALID [2022-04-15 02:08:25,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1138#false} is VALID [2022-04-15 02:08:25,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1138#false} is VALID [2022-04-15 02:08:25,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1138#false} is VALID [2022-04-15 02:08:25,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 5)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1138#false} is VALID [2022-04-15 02:08:25,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 5)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1229#(< |main_#t~post5| 5)} is VALID [2022-04-15 02:08:25,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 5)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1233#(< ~counter~0 5)} is VALID [2022-04-15 02:08:25,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 5)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1233#(< ~counter~0 5)} is VALID [2022-04-15 02:08:25,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1233#(< ~counter~0 5)} is VALID [2022-04-15 02:08:25,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 4)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 4)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-15 02:08:25,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-15 02:08:25,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1137#true} is VALID [2022-04-15 02:08:25,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 4)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1137#true} is VALID [2022-04-15 02:08:25,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 4)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 4)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 4)} {1137#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 4)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1243#(< ~counter~0 4)} is VALID [2022-04-15 02:08:25,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#true} is VALID [2022-04-15 02:08:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:08:25,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:08:25,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893903692] [2022-04-15 02:08:25,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:08:25,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292051950] [2022-04-15 02:08:25,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292051950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:08:25,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:08:25,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 02:08:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797192066] [2022-04-15 02:08:25,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:08:25,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-15 02:08:25,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:08:25,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:08:25,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:08:25,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 02:08:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:08:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 02:08:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 02:08:25,714 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:08:35,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:08:43,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:08:50,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:08:55,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:08:57,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:09:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:09:01,400 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-15 02:09:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 02:09:01,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-15 02:09:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:09:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-15 02:09:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-15 02:09:01,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2022-04-15 02:09:01,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:09:01,546 INFO L225 Difference]: With dead ends: 108 [2022-04-15 02:09:01,547 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 02:09:01,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:09:01,548 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 69 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 26 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-04-15 02:09:01,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 250 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 84 Invalid, 5 Unknown, 0 Unchecked, 14.8s Time] [2022-04-15 02:09:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 02:09:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-15 02:09:01,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:09:01,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:09:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:09:01,572 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:09:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:09:01,576 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-15 02:09:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-15 02:09:01,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:09:01,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:09:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-15 02:09:01,577 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-15 02:09:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:09:01,581 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-15 02:09:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-15 02:09:01,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:09:01,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:09:01,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:09:01,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:09:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 02:09:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-15 02:09:01,585 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-15 02:09:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:09:01,585 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-15 02:09:01,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-15 02:09:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 02:09:01,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:09:01,586 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:09:01,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 02:09:01,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:09:01,809 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:09:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:09:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1731080004, now seen corresponding path program 1 times [2022-04-15 02:09:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:09:01,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476923739] [2022-04-15 02:09:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:09:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:09:01,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:09:01,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894052935] [2022-04-15 02:09:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:09:01,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:09:01,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:09:01,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:09:01,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 02:09:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:01,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:09:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:01,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:09:02,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-15 02:09:02,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1731#(<= ~counter~0 0)} is VALID [2022-04-15 02:09:02,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1765#(<= ~counter~0 1)} is VALID [2022-04-15 02:09:02,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1765#(<= ~counter~0 1)} is VALID [2022-04-15 02:09:02,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1765#(<= ~counter~0 1)} is VALID [2022-04-15 02:09:02,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-15 02:09:02,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1724#false} is VALID [2022-04-15 02:09:02,011 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1724#false} is VALID [2022-04-15 02:09:02,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1724#false} is VALID [2022-04-15 02:09:02,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-15 02:09:02,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-15 02:09:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:09:02,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:09:02,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-15 02:09:02,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1724#false} is VALID [2022-04-15 02:09:02,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1724#false} is VALID [2022-04-15 02:09:02,162 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1724#false} is VALID [2022-04-15 02:09:02,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 5)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1724#false} is VALID [2022-04-15 02:09:02,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 5)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1813#(< |main_#t~post6| 5)} is VALID [2022-04-15 02:09:02,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 5)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1817#(< ~counter~0 5)} is VALID [2022-04-15 02:09:02,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 5)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1817#(< ~counter~0 5)} is VALID [2022-04-15 02:09:02,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1817#(< ~counter~0 5)} is VALID [2022-04-15 02:09:02,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1827#(< ~counter~0 4)} is VALID [2022-04-15 02:09:02,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1827#(< ~counter~0 4)} is VALID [2022-04-15 02:09:02,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1827#(< ~counter~0 4)} is VALID [2022-04-15 02:09:02,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#(<= ~counter~0 2)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1775#(<= ~counter~0 2)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-15 02:09:02,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-15 02:09:02,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1723#true} is VALID [2022-04-15 02:09:02,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#(<= ~counter~0 2)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1723#true} is VALID [2022-04-15 02:09:02,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#(<= ~counter~0 2)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#(<= ~counter~0 2)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#(<= ~counter~0 2)} {1723#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#(<= ~counter~0 2)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1775#(<= ~counter~0 2)} is VALID [2022-04-15 02:09:02,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#true} is VALID [2022-04-15 02:09:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:09:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:09:02,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476923739] [2022-04-15 02:09:02,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:09:02,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894052935] [2022-04-15 02:09:02,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894052935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:09:02,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:09:02,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 02:09:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410668250] [2022-04-15 02:09:02,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:09:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-15 02:09:02,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:09:02,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:02,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:09:02,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:09:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:09:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:09:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:09:02,201 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:05,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:09:07,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:09,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:15,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:18,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:09:30,866 INFO L93 Difference]: Finished difference Result 122 states and 163 transitions. [2022-04-15 02:09:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 02:09:30,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-15 02:09:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:09:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2022-04-15 02:09:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2022-04-15 02:09:30,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 145 transitions. [2022-04-15 02:09:31,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:09:31,008 INFO L225 Difference]: With dead ends: 122 [2022-04-15 02:09:31,008 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 02:09:31,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:09:31,009 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 85 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:09:31,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 12.1s Time] [2022-04-15 02:09:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 02:09:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-15 02:09:31,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:09:31,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 108 states, 61 states have (on average 1.278688524590164) internal successors, (78), 65 states have internal predecessors, (78), 37 states have call successors, (37), 10 states have call predecessors, (37), 9 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-15 02:09:31,069 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 108 states, 61 states have (on average 1.278688524590164) internal successors, (78), 65 states have internal predecessors, (78), 37 states have call successors, (37), 10 states have call predecessors, (37), 9 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-15 02:09:31,069 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 108 states, 61 states have (on average 1.278688524590164) internal successors, (78), 65 states have internal predecessors, (78), 37 states have call successors, (37), 10 states have call predecessors, (37), 9 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-15 02:09:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:09:31,074 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-04-15 02:09:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2022-04-15 02:09:31,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:09:31,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:09:31,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 61 states have (on average 1.278688524590164) internal successors, (78), 65 states have internal predecessors, (78), 37 states have call successors, (37), 10 states have call predecessors, (37), 9 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 113 states. [2022-04-15 02:09:31,076 INFO L87 Difference]: Start difference. First operand has 108 states, 61 states have (on average 1.278688524590164) internal successors, (78), 65 states have internal predecessors, (78), 37 states have call successors, (37), 10 states have call predecessors, (37), 9 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 113 states. [2022-04-15 02:09:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:09:31,080 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-04-15 02:09:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2022-04-15 02:09:31,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:09:31,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:09:31,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:09:31,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:09:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.278688524590164) internal successors, (78), 65 states have internal predecessors, (78), 37 states have call successors, (37), 10 states have call predecessors, (37), 9 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-15 02:09:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2022-04-15 02:09:31,086 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 24 [2022-04-15 02:09:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:09:31,088 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2022-04-15 02:09:31,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 02:09:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2022-04-15 02:09:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 02:09:31,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:09:31,088 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:09:31,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 02:09:31,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:09:31,305 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:09:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:09:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1729947946, now seen corresponding path program 1 times [2022-04-15 02:09:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:09:31,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54643456] [2022-04-15 02:09:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:09:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:09:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:09:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:31,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {2460#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2446#true} is VALID [2022-04-15 02:09:31,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {2446#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2446#true} {2446#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:09:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:31,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {2446#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2446#true} is VALID [2022-04-15 02:09:31,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {2446#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {2446#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:31,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {2446#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2460#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:09:31,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2460#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2446#true} is VALID [2022-04-15 02:09:31,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {2446#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {2446#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {2446#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {2446#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {2446#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {2446#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {2446#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2446#true} {2446#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:31,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2456#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 02:09:31,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2456#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 02:09:31,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2456#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 02:09:31,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2457#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 02:09:31,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {2457#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2457#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 02:09:31,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {2457#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2457#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 02:09:31,472 INFO L272 TraceCheckUtils]: 20: Hoare triple {2457#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2458#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:09:31,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {2458#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2459#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:09:31,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {2459#(not (= __VERIFIER_assert_~cond 0))} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2447#false} is VALID [2022-04-15 02:09:31,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {2447#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#false} is VALID [2022-04-15 02:09:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:09:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:09:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54643456] [2022-04-15 02:09:31,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54643456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 02:09:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93770916] [2022-04-15 02:09:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:09:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:09:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:09:31,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:09:31,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 02:09:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:31,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 02:09:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:09:31,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:09:31,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {2446#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {2446#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2446#true} is VALID [2022-04-15 02:09:31,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {2446#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {2446#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {2446#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {2446#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {2446#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {2446#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {2446#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:31,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2446#true} {2446#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:31,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2506#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {2506#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2506#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {2506#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2506#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-15 02:09:31,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {2506#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2516#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-15 02:09:31,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {2516#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2516#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-15 02:09:31,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2516#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-15 02:09:31,818 INFO L272 TraceCheckUtils]: 20: Hoare triple {2516#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:09:31,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {2526#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:09:31,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {2530#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2447#false} is VALID [2022-04-15 02:09:31,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {2447#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#false} is VALID [2022-04-15 02:09:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:09:31,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:09:32,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {2447#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#false} is VALID [2022-04-15 02:09:32,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {2530#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2447#false} is VALID [2022-04-15 02:09:32,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {2526#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:09:32,084 INFO L272 TraceCheckUtils]: 20: Hoare triple {2546#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {2526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:09:32,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2546#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-15 02:09:32,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {2546#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2546#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-15 02:09:32,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {2556#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2546#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-15 02:09:32,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {2556#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2556#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-15 02:09:32,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {2556#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2556#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-15 02:09:32,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {2566#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {2556#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-15 02:09:32,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {2566#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2566#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-15 02:09:32,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {2566#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2566#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-15 02:09:32,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {2566#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-15 02:09:32,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2446#true} {2446#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {2446#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {2446#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {2446#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {2446#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2446#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {2446#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:32,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2446#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:32,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {2446#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2446#true} is VALID [2022-04-15 02:09:32,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {2446#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#true} is VALID [2022-04-15 02:09:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:09:32,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93770916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:09:32,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 02:09:32,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-15 02:09:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677654505] [2022-04-15 02:09:32,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 02:09:32,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 02:09:32,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:09:32,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:09:32,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:09:32,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 02:09:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:09:32,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 02:09:32,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-15 02:09:32,141 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:09:37,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:09:39,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:09:41,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:09:43,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:09:45,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:47,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:50,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:54,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:56,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:09:59,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:10:04,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:06,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:10,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:15,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:17,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:20,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:30,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:34,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:39,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:50,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:10:52,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 02:10:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:10:58,616 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2022-04-15 02:10:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 02:10:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-15 02:10:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:10:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:10:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-15 02:10:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:10:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-15 02:10:58,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-15 02:10:59,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:10:59,473 INFO L225 Difference]: With dead ends: 164 [2022-04-15 02:10:59,473 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 02:10:59,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-15 02:10:59,474 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 50 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 116 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.4s IncrementalHoareTripleChecker+Time [2022-04-15 02:10:59,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 186 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 602 Invalid, 17 Unknown, 0 Unchecked, 56.4s Time] [2022-04-15 02:10:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 02:10:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2022-04-15 02:10:59,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:10:59,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 142 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 49 states have call successors, (49), 13 states have call predecessors, (49), 12 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 02:10:59,539 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 142 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 49 states have call successors, (49), 13 states have call predecessors, (49), 12 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 02:10:59,540 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 142 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 49 states have call successors, (49), 13 states have call predecessors, (49), 12 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 02:10:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:10:59,546 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. [2022-04-15 02:10:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2022-04-15 02:10:59,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:10:59,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:10:59,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 49 states have call successors, (49), 13 states have call predecessors, (49), 12 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 149 states. [2022-04-15 02:10:59,548 INFO L87 Difference]: Start difference. First operand has 142 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 49 states have call successors, (49), 13 states have call predecessors, (49), 12 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 149 states. [2022-04-15 02:10:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:10:59,556 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. [2022-04-15 02:10:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2022-04-15 02:10:59,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:10:59,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:10:59,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:10:59,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:10:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 49 states have call successors, (49), 13 states have call predecessors, (49), 12 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 02:10:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 192 transitions. [2022-04-15 02:10:59,565 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 192 transitions. Word has length 24 [2022-04-15 02:10:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:10:59,565 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 192 transitions. [2022-04-15 02:10:59,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:10:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 192 transitions. [2022-04-15 02:10:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 02:10:59,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:10:59,566 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:10:59,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 02:10:59,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:10:59,784 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:10:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:10:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2026335537, now seen corresponding path program 1 times [2022-04-15 02:10:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:10:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614213968] [2022-04-15 02:10:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:10:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:10:59,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:10:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211080126] [2022-04-15 02:10:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:10:59,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:10:59,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:10:59,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:10:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 02:10:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:10:59,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:10:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:10:59,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:11:00,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {3379#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3379#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {3379#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3379#true} {3379#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {3379#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {3379#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {3379#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {3379#true} is VALID [2022-04-15 02:11:00,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {3379#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3379#true} is VALID [2022-04-15 02:11:00,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {3379#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {3379#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3379#true} {3379#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {3379#true} is VALID [2022-04-15 02:11:00,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {3379#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,128 INFO L272 TraceCheckUtils]: 17: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {3379#true} is VALID [2022-04-15 02:11:00,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {3379#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3379#true} is VALID [2022-04-15 02:11:00,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {3379#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {3379#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,129 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3379#true} {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [150] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,129 INFO L272 TraceCheckUtils]: 22: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [134] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {3379#true} is VALID [2022-04-15 02:11:00,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {3379#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3379#true} is VALID [2022-04-15 02:11:00,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {3379#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {3379#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3379#true} is VALID [2022-04-15 02:11:00,130 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3379#true} {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 02:11:00,132 INFO L272 TraceCheckUtils]: 27: Hoare triple {3417#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [139] L40-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* (* v_main_~q~0_18 (* v_main_~n~0_18 .cse0)) 4294967295) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_18 16))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_18, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {3466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:11:00,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {3466#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:11:00,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {3470#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3380#false} is VALID [2022-04-15 02:11:00,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {3380#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3380#false} is VALID [2022-04-15 02:11:00,134 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-15 02:11:00,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:11:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:11:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614213968] [2022-04-15 02:11:00,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:11:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211080126] [2022-04-15 02:11:00,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211080126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:11:00,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:11:00,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:11:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684236328] [2022-04-15 02:11:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:11:00,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-15 02:11:00,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:11:00,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:00,164 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-15 02:11:00,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:11:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:11:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:11:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:11:00,165 INFO L87 Difference]: Start difference. First operand 142 states and 192 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:07,418 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2022-04-15 02:11:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:11:07,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-15 02:11:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:11:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 02:11:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 02:11:07,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-15 02:11:07,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:07,514 INFO L225 Difference]: With dead ends: 152 [2022-04-15 02:11:07,514 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 02:11:07,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:11:07,527 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:11:07,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 02:11:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 02:11:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-15 02:11:07,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:11:07,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:07,564 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:07,564 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:07,568 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-04-15 02:11:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-15 02:11:07,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:07,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:07,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 116 states. [2022-04-15 02:11:07,569 INFO L87 Difference]: Start difference. First operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 116 states. [2022-04-15 02:11:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:07,572 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-04-15 02:11:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-15 02:11:07,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:07,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:07,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:11:07,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:11:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2022-04-15 02:11:07,577 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 31 [2022-04-15 02:11:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:11:07,577 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-04-15 02:11:07,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-15 02:11:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 02:11:07,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:11:07,578 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:11:07,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 02:11:07,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:11:07,783 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:11:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:11:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash -266035918, now seen corresponding path program 1 times [2022-04-15 02:11:07,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:11:07,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248476637] [2022-04-15 02:11:07,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:11:07,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:11:07,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173553757] [2022-04-15 02:11:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:07,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:11:07,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:11:07,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:11:07,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 02:11:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:07,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 02:11:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:07,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:11:08,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {4103#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4103#true} is VALID [2022-04-15 02:11:08,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {4103#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4103#true} {4103#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {4103#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {4103#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {4103#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {4103#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {4103#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {4103#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4103#true} {4103#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4103#true} is VALID [2022-04-15 02:11:08,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {4103#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,051 INFO L272 TraceCheckUtils]: 20: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4103#true} is VALID [2022-04-15 02:11:08,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {4103#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4103#true} is VALID [2022-04-15 02:11:08,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {4103#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {4103#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,052 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4103#true} {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [150] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,053 INFO L272 TraceCheckUtils]: 25: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [134] L39-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {4103#true} is VALID [2022-04-15 02:11:08,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {4103#true} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4103#true} is VALID [2022-04-15 02:11:08,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {4103#true} [133] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {4103#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4103#true} is VALID [2022-04-15 02:11:08,054 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4103#true} {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* v_main_~n~0_17 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_17, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {4141#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 02:11:08,055 INFO L272 TraceCheckUtils]: 30: Hoare triple {4141#(and (= main_~p~0 0) (= main_~h~0 0))} [139] L40-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* (* v_main_~q~0_18 (* v_main_~n~0_18 .cse0)) 4294967295) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_18 16))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_18, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:11:08,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {4199#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:11:08,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {4203#(<= 1 __VERIFIER_assert_~cond)} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4104#false} is VALID [2022-04-15 02:11:08,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {4104#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4104#false} is VALID [2022-04-15 02:11:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 02:11:08,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:11:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:11:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248476637] [2022-04-15 02:11:08,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:11:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173553757] [2022-04-15 02:11:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173553757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:11:08,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:11:08,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:11:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864341321] [2022-04-15 02:11:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:11:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-15 02:11:08,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:11:08,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:08,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:08,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:11:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:11:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:11:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:11:08,090 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:13,502 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2022-04-15 02:11:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:11:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-15 02:11:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:11:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 02:11:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 02:11:13,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-15 02:11:13,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:13,604 INFO L225 Difference]: With dead ends: 138 [2022-04-15 02:11:13,604 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 02:11:13,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:11:13,605 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 02:11:13,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 02:11:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 02:11:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-04-15 02:11:13,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:11:13,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:13,660 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:13,660 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:13,664 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-04-15 02:11:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-15 02:11:13,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:13,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:13,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-15 02:11:13,665 INFO L87 Difference]: Start difference. First operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-15 02:11:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:13,669 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-04-15 02:11:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-15 02:11:13,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:13,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:13,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:11:13,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:11:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2022-04-15 02:11:13,673 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 34 [2022-04-15 02:11:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:11:13,673 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2022-04-15 02:11:13,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 02:11:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2022-04-15 02:11:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 02:11:13,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:11:13,674 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:11:13,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 02:11:13,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:11:13,877 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:11:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:11:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1209382940, now seen corresponding path program 1 times [2022-04-15 02:11:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:11:13,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411149470] [2022-04-15 02:11:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:11:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:14,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:11:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:14,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {4883#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4873#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4873#(<= ~counter~0 0)} {4868#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:11:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:14,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {4868#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4868#true} is VALID [2022-04-15 02:11:14,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {4868#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {4868#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4868#true} {4873#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {4868#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4883#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:11:14,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {4883#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {4873#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4873#(<= ~counter~0 0)} {4868#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {4873#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {4873#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {4873#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4868#true} is VALID [2022-04-15 02:11:14,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {4868#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4868#true} is VALID [2022-04-15 02:11:14,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {4868#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {4868#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4868#true} {4873#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {4873#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {4873#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {4878#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {4878#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {4878#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {4880#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {4880#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {4880#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {4881#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {4881#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {4881#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4882#(<= |main_#t~post5| 4)} is VALID [2022-04-15 02:11:14,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {4882#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4869#false} is VALID [2022-04-15 02:11:14,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {4869#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4869#false} is VALID [2022-04-15 02:11:14,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {4869#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4869#false} is VALID [2022-04-15 02:11:14,053 INFO L272 TraceCheckUtils]: 28: Hoare triple {4869#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4869#false} is VALID [2022-04-15 02:11:14,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {4869#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4869#false} is VALID [2022-04-15 02:11:14,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {4869#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4869#false} is VALID [2022-04-15 02:11:14,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {4869#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4869#false} is VALID [2022-04-15 02:11:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:11:14,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:11:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411149470] [2022-04-15 02:11:14,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411149470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 02:11:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512348460] [2022-04-15 02:11:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:14,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:11:14,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:11:14,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:11:14,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 02:11:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:14,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 02:11:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:14,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:11:14,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {4868#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {4868#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {4873#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4873#(<= ~counter~0 0)} {4868#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {4873#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {4873#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {4873#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4873#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {4873#(<= ~counter~0 0)} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {4873#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4873#(<= ~counter~0 0)} {4873#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {4873#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {4873#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {4878#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {4878#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {4878#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {4880#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {4880#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {4880#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {4881#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {4881#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {4881#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4882#(<= |main_#t~post5| 4)} is VALID [2022-04-15 02:11:14,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {4882#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4869#false} is VALID [2022-04-15 02:11:14,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {4869#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4869#false} is VALID [2022-04-15 02:11:14,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {4869#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4869#false} is VALID [2022-04-15 02:11:14,392 INFO L272 TraceCheckUtils]: 28: Hoare triple {4869#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4869#false} is VALID [2022-04-15 02:11:14,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {4869#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4869#false} is VALID [2022-04-15 02:11:14,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {4869#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4869#false} is VALID [2022-04-15 02:11:14,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {4869#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4869#false} is VALID [2022-04-15 02:11:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:11:14,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:11:14,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {4869#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4869#false} is VALID [2022-04-15 02:11:14,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {4869#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4869#false} is VALID [2022-04-15 02:11:14,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {4869#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4869#false} is VALID [2022-04-15 02:11:14,669 INFO L272 TraceCheckUtils]: 28: Hoare triple {4869#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {4869#false} is VALID [2022-04-15 02:11:14,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {4869#false} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4869#false} is VALID [2022-04-15 02:11:14,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {4869#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4869#false} is VALID [2022-04-15 02:11:14,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {4882#(<= |main_#t~post5| 4)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4869#false} is VALID [2022-04-15 02:11:14,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {4881#(<= ~counter~0 4)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4882#(<= |main_#t~post5| 4)} is VALID [2022-04-15 02:11:14,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {4881#(<= ~counter~0 4)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {4881#(<= ~counter~0 4)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {4880#(<= ~counter~0 3)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4881#(<= ~counter~0 4)} is VALID [2022-04-15 02:11:14,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {4880#(<= ~counter~0 3)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {4880#(<= ~counter~0 3)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(<= ~counter~0 2)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4880#(<= ~counter~0 3)} is VALID [2022-04-15 02:11:14,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#(<= ~counter~0 2)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#(<= ~counter~0 2)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {4878#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4879#(<= ~counter~0 2)} is VALID [2022-04-15 02:11:14,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {4878#(<= ~counter~0 1)} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {4878#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {4873#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4878#(<= ~counter~0 1)} is VALID [2022-04-15 02:11:14,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {4873#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4868#true} {4873#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {4868#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {4868#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {4868#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4868#true} is VALID [2022-04-15 02:11:14,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {4873#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {4868#true} is VALID [2022-04-15 02:11:14,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {4873#(<= ~counter~0 0)} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {4873#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4873#(<= ~counter~0 0)} {4868#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {4873#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {4868#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4873#(<= ~counter~0 0)} is VALID [2022-04-15 02:11:14,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {4868#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#true} is VALID [2022-04-15 02:11:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 02:11:14,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512348460] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:11:14,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 02:11:14,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-15 02:11:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130673180] [2022-04-15 02:11:14,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 02:11:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-15 02:11:14,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:11:14,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:11:14,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:14,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:11:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:11:14,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:11:14,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:11:14,723 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:11:18,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:23,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:25,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:28,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:30,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:34,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:37,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 02:11:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:38,840 INFO L93 Difference]: Finished difference Result 185 states and 233 transitions. [2022-04-15 02:11:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 02:11:38,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-15 02:11:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:11:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:11:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-15 02:11:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:11:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-15 02:11:38,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2022-04-15 02:11:38,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:38,972 INFO L225 Difference]: With dead ends: 185 [2022-04-15 02:11:38,972 INFO L226 Difference]: Without dead ends: 145 [2022-04-15 02:11:38,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-04-15 02:11:38,973 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 69 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 52 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-04-15 02:11:38,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 105 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 18.9s Time] [2022-04-15 02:11:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-15 02:11:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2022-04-15 02:11:39,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:11:39,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:39,035 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:39,036 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:39,038 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-04-15 02:11:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2022-04-15 02:11:39,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:39,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:39,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 145 states. [2022-04-15 02:11:39,040 INFO L87 Difference]: Start difference. First operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 145 states. [2022-04-15 02:11:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:39,042 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-04-15 02:11:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2022-04-15 02:11:39,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:39,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:39,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:11:39,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:11:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-15 02:11:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2022-04-15 02:11:39,046 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 32 [2022-04-15 02:11:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:11:39,046 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2022-04-15 02:11:39,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 02:11:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2022-04-15 02:11:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 02:11:39,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:11:39,047 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:11:39,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 02:11:39,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 02:11:39,263 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:11:39,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:11:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -55903719, now seen corresponding path program 2 times [2022-04-15 02:11:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:11:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763157813] [2022-04-15 02:11:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:11:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:39,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:11:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:39,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {5862#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {5850#true} is VALID [2022-04-15 02:11:39,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5850#true} {5850#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:11:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:11:39,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {5850#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5850#true} is VALID [2022-04-15 02:11:39,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {5850#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5850#true} is VALID [2022-04-15 02:11:39,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {5850#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5862#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:11:39,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {5862#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {5850#true} is VALID [2022-04-15 02:11:39,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#true} {5850#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#true} [109] mainENTRY-->L24: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {5850#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {5850#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {5850#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5850#true} {5850#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {5850#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {5850#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {5850#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {5850#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {5850#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {5850#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {5850#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {5850#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {5850#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {5850#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {5850#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {5850#true} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5850#true} is VALID [2022-04-15 02:11:39,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {5850#true} [127] L31-->L30-3: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {5850#true} is VALID [2022-04-15 02:11:39,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {5850#true} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5859#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-15 02:11:39,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {5859#(<= (+ |main_#t~post5| 1) ~counter~0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5860#(<= 6 ~counter~0)} is VALID [2022-04-15 02:11:39,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {5860#(<= 6 ~counter~0)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5861#(<= 6 |main_#t~post6|)} is VALID [2022-04-15 02:11:39,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {5861#(<= 6 |main_#t~post6|)} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5851#false} is VALID [2022-04-15 02:11:39,374 INFO L272 TraceCheckUtils]: 31: Hoare triple {5851#false} [130] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {5851#false} is VALID [2022-04-15 02:11:39,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {5851#false} [129] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5851#false} is VALID [2022-04-15 02:11:39,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {5851#false} [132] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5851#false} is VALID [2022-04-15 02:11:39,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {5851#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5851#false} is VALID [2022-04-15 02:11:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-15 02:11:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:11:39,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763157813] [2022-04-15 02:11:39,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763157813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:11:39,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:11:39,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 02:11:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064527771] [2022-04-15 02:11:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:11:39,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-04-15 02:11:39,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:11:39,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:11:39,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:39,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 02:11:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:11:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 02:11:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:11:39,393 INFO L87 Difference]: Start difference. First operand 142 states and 177 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:11:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:47,507 INFO L93 Difference]: Finished difference Result 179 states and 226 transitions. [2022-04-15 02:11:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 02:11:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-04-15 02:11:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:11:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:11:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 02:11:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:11:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 02:11:47,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-15 02:11:47,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:11:47,588 INFO L225 Difference]: With dead ends: 179 [2022-04-15 02:11:47,588 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 02:11:47,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 02:11:47,589 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:11:47,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 02:11:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 02:11:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2022-04-15 02:11:47,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:11:47,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 02:11:47,642 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 02:11:47,642 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 02:11:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:47,645 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2022-04-15 02:11:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-04-15 02:11:47,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:47,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:47,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 139 states. [2022-04-15 02:11:47,646 INFO L87 Difference]: Start difference. First operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 139 states. [2022-04-15 02:11:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:11:47,649 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2022-04-15 02:11:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-04-15 02:11:47,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:11:47,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:11:47,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:11:47,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:11:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 02:11:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-15 02:11:47,652 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 35 [2022-04-15 02:11:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:11:47,652 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-15 02:11:47,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 02:11:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-15 02:11:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 02:11:47,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:11:47,653 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:11:47,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 02:11:47,653 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:11:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:11:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -926681017, now seen corresponding path program 1 times [2022-04-15 02:11:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:11:47,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336371712] [2022-04-15 02:11:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:11:47,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:11:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141846335] [2022-04-15 02:11:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:11:47,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:11:47,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:11:47,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:11:47,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process