/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/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:19:09,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:19:09,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:19:09,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:19:09,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:19:09,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:19:09,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:19:09,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:19:09,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:19:09,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:19:09,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:19:09,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:19:09,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:19:09,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:19:09,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:19:09,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:19:09,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:19:09,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:19:09,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:19:09,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:19:09,136 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:19:09,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:19:09,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:19:09,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:19:09,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:19:09,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:19:09,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:19:09,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:19:09,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:19:09,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:19:09,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:19:09,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:19:09,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:19:09,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:19:09,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:19:09,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:19:09,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:19:09,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:19:09,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:19:09,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:19:09,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:19:09,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:19:09,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:19:09,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:19:09,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:19:09,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:19:09,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:19:09,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:19:09,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:19:09,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:19:09,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:19:09,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:19:09,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:19:09,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:19:09,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:19:09,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:19:09,168 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:19:09,168 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:19:09,168 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:19:09,169 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:19:09,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:19:09,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:19:09,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:19:09,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:19:09,385 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:19:09,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-27 22:19:09,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45e35a34/c83acd1f6f174c158e5877e2872728c3/FLAGcc3b0ca68 [2022-04-27 22:19:09,764 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:19:09,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-27 22:19:09,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45e35a34/c83acd1f6f174c158e5877e2872728c3/FLAGcc3b0ca68 [2022-04-27 22:19:10,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45e35a34/c83acd1f6f174c158e5877e2872728c3 [2022-04-27 22:19:10,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:19:10,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:19:10,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:19:10,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:19:10,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:19:10,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48615b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10, skipping insertion in model container [2022-04-27 22:19:10,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:19:10,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:19:10,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-27 22:19:10,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:19:10,364 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:19:10,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-27 22:19:10,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:19:10,382 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:19:10,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10 WrapperNode [2022-04-27 22:19:10,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:19:10,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:19:10,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:19:10,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:19:10,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:19:10,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:19:10,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:19:10,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:19:10,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:19:10,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:19:10,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:19:10,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:19:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:19:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:19:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:19:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:19:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:19:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:19:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:19:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:19:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:19:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:19:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:19:10,499 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:19:10,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:19:10,673 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:19:10,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:19:10,678 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 22:19:10,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:10 BoogieIcfgContainer [2022-04-27 22:19:10,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:19:10,680 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:19:10,680 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:19:10,700 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:19:10,702 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:10" (1/1) ... [2022-04-27 22:19:10,703 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:19:10,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:19:10 BasicIcfg [2022-04-27 22:19:10,727 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:19:10,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:19:10,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:19:10,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:19:10,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:10" (1/4) ... [2022-04-27 22:19:10,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f9d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:10, skipping insertion in model container [2022-04-27 22:19:10,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:10" (2/4) ... [2022-04-27 22:19:10,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f9d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:10, skipping insertion in model container [2022-04-27 22:19:10,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:10" (3/4) ... [2022-04-27 22:19:10,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f9d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:10, skipping insertion in model container [2022-04-27 22:19:10,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:19:10" (4/4) ... [2022-04-27 22:19:10,740 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.cqvasr [2022-04-27 22:19:10,749 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:19:10,751 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:19:10,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:19:10,795 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3660e04a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@349b2214 [2022-04-27 22:19:10,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:19:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 22:19:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 22:19:10,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:10,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:10,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1895308246, now seen corresponding path program 1 times [2022-04-27 22:19:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201115695] [2022-04-27 22:19:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 22:19:11,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:19:11,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:19:11,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:11,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 22:19:11,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:19:11,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:19:11,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:19:11,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {31#true} is VALID [2022-04-27 22:19:11,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {31#true} is VALID [2022-04-27 22:19:11,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {31#true} is VALID [2022-04-27 22:19:11,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {31#true} is VALID [2022-04-27 22:19:11,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {31#true} is VALID [2022-04-27 22:19:11,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} [113] L23-3-->L23-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:19:11,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {32#false} is VALID [2022-04-27 22:19:11,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {32#false} is VALID [2022-04-27 22:19:11,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} [120] L6-->L7: Formula: (= 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[] {32#false} is VALID [2022-04-27 22:19:11,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:19:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:11,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201115695] [2022-04-27 22:19:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201115695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:11,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:19:11,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:19:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868882217] [2022-04-27 22:19:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:11,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:19:11,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:11,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:19:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:19:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:19:11,077 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:11,168 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-27 22:19:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:19:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:19:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-27 22:19:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-27 22:19:11,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-27 22:19:11,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:11,268 INFO L225 Difference]: With dead ends: 50 [2022-04-27 22:19:11,268 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 22:19:11,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:19:11,274 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:11,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:19:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 22:19:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 22:19:11,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:11,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,296 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,296 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:11,299 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 22:19:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 22:19:11,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:11,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:11,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 22:19:11,300 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 22:19:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:11,305 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 22:19:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 22:19:11,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:11,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:11,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:11,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-27 22:19:11,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-27 22:19:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:11,316 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-27 22:19:11,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 22:19:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 22:19:11,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:11,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:11,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:19:11,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1894384725, now seen corresponding path program 1 times [2022-04-27 22:19:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:11,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386916484] [2022-04-27 22:19:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {187#true} is VALID [2022-04-27 22:19:11,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#true} is VALID [2022-04-27 22:19:11,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#true} {187#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#true} is VALID [2022-04-27 22:19:11,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {187#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:11,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {187#true} is VALID [2022-04-27 22:19:11,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#true} is VALID [2022-04-27 22:19:11,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#true} is VALID [2022-04-27 22:19:11,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#true} is VALID [2022-04-27 22:19:11,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {187#true} is VALID [2022-04-27 22:19:11,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {187#true} is VALID [2022-04-27 22:19:11,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {187#true} is VALID [2022-04-27 22:19:11,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {187#true} is VALID [2022-04-27 22:19:11,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {192#(= main_~v~0 0)} is VALID [2022-04-27 22:19:11,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {192#(= main_~v~0 0)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {188#false} is VALID [2022-04-27 22:19:11,437 INFO L272 TraceCheckUtils]: 11: Hoare triple {188#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {188#false} is VALID [2022-04-27 22:19:11,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {188#false} is VALID [2022-04-27 22:19:11,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {188#false} [120] L6-->L7: Formula: (= 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[] {188#false} is VALID [2022-04-27 22:19:11,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {188#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#false} is VALID [2022-04-27 22:19:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386916484] [2022-04-27 22:19:11,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386916484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:11,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:19:11,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 22:19:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973276660] [2022-04-27 22:19:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:19:11,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:11,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:11,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 22:19:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 22:19:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 22:19:11,455 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:11,536 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-27 22:19:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 22:19:11,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:19:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 22:19:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 22:19:11,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-27 22:19:11,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:11,583 INFO L225 Difference]: With dead ends: 49 [2022-04-27 22:19:11,583 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 22:19:11,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:19:11,588 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:11,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:19:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 22:19:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-27 22:19:11,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:11,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,595 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,595 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:11,598 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 22:19:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 22:19:11,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:11,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:11,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 22:19:11,600 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 22:19:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:11,603 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 22:19:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 22:19:11,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:11,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:11,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:11,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 22:19:11,611 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-27 22:19:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:11,611 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 22:19:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 22:19:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:19:11,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:11,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:11,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:19:11,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1473809801, now seen corresponding path program 1 times [2022-04-27 22:19:11,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:11,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367667142] [2022-04-27 22:19:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {371#true} is VALID [2022-04-27 22:19:11,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:11,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {371#true} is VALID [2022-04-27 22:19:11,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {371#true} is VALID [2022-04-27 22:19:11,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {371#true} is VALID [2022-04-27 22:19:11,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {371#true} is VALID [2022-04-27 22:19:11,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {371#true} is VALID [2022-04-27 22:19:11,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {376#(= main_~v~0 0)} is VALID [2022-04-27 22:19:11,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {376#(= main_~v~0 0)} is VALID [2022-04-27 22:19:11,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {377#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:19:11,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-27 22:19:11,686 INFO L272 TraceCheckUtils]: 13: Hoare triple {372#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {372#false} is VALID [2022-04-27 22:19:11,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {372#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {372#false} is VALID [2022-04-27 22:19:11,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} [120] L6-->L7: Formula: (= 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[] {372#false} is VALID [2022-04-27 22:19:11,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-27 22:19:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367667142] [2022-04-27 22:19:11,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367667142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:19:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151321794] [2022-04-27 22:19:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:11,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:19:11,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:19:11,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:19:11,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:19:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 22:19:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:19:11,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {371#true} is VALID [2022-04-27 22:19:11,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {371#true} is VALID [2022-04-27 22:19:11,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {371#true} is VALID [2022-04-27 22:19:11,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {371#true} is VALID [2022-04-27 22:19:11,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {371#true} is VALID [2022-04-27 22:19:11,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {376#(= main_~v~0 0)} is VALID [2022-04-27 22:19:11,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {376#(= main_~v~0 0)} is VALID [2022-04-27 22:19:11,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {415#(= main_~v~0 1)} is VALID [2022-04-27 22:19:11,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#(= main_~v~0 1)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-27 22:19:11,821 INFO L272 TraceCheckUtils]: 13: Hoare triple {372#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {372#false} is VALID [2022-04-27 22:19:11,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {372#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {372#false} is VALID [2022-04-27 22:19:11,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} [120] L6-->L7: Formula: (= 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[] {372#false} is VALID [2022-04-27 22:19:11,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-27 22:19:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:11,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:19:11,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-27 22:19:11,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} [120] L6-->L7: Formula: (= 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[] {372#false} is VALID [2022-04-27 22:19:11,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {372#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {372#false} is VALID [2022-04-27 22:19:11,883 INFO L272 TraceCheckUtils]: 13: Hoare triple {372#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {372#false} is VALID [2022-04-27 22:19:11,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(< (mod main_~v~0 4294967296) 10)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-27 22:19:11,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {447#(< (mod (+ main_~v~0 1) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {443#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-27 22:19:11,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {447#(< (mod (+ main_~v~0 1) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {447#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 22:19:11,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {447#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 22:19:11,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {371#true} is VALID [2022-04-27 22:19:11,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {371#true} is VALID [2022-04-27 22:19:11,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {371#true} is VALID [2022-04-27 22:19:11,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {371#true} is VALID [2022-04-27 22:19:11,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {371#true} is VALID [2022-04-27 22:19:11,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-27 22:19:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151321794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:19:11,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:19:11,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 22:19:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485309897] [2022-04-27 22:19:11,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:19:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 22:19:11,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:11,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:11,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:11,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:19:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:19:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:19:11,905 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:12,118 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 22:19:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:19:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 22:19:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 22:19:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 22:19:12,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-27 22:19:12,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:12,185 INFO L225 Difference]: With dead ends: 55 [2022-04-27 22:19:12,185 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 22:19:12,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:19:12,187 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:12,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 41 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:19:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 22:19:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-27 22:19:12,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:12,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:12,193 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:12,193 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:12,194 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 22:19:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 22:19:12,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:12,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:12,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 22:19:12,195 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 22:19:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:12,196 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 22:19:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 22:19:12,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:12,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:12,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:12,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-27 22:19:12,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-04-27 22:19:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:12,198 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-27 22:19:12,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-27 22:19:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 22:19:12,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:12,199 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:12,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:19:12,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:19:12,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1878931933, now seen corresponding path program 2 times [2022-04-27 22:19:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:12,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891856747] [2022-04-27 22:19:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:12,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {693#true} is VALID [2022-04-27 22:19:12,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693#true} {693#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:12,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {693#true} is VALID [2022-04-27 22:19:12,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {693#true} is VALID [2022-04-27 22:19:12,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {693#true} is VALID [2022-04-27 22:19:12,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {693#true} is VALID [2022-04-27 22:19:12,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {693#true} is VALID [2022-04-27 22:19:12,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {698#(= main_~v~0 0)} is VALID [2022-04-27 22:19:12,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {698#(= main_~v~0 0)} is VALID [2022-04-27 22:19:12,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 22:19:12,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 22:19:12,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 22:19:12,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 22:19:12,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 22:19:12,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 22:19:12,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {702#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:19:12,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-27 22:19:12,526 INFO L272 TraceCheckUtils]: 19: Hoare triple {694#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {694#false} is VALID [2022-04-27 22:19:12,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {694#false} is VALID [2022-04-27 22:19:12,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#false} [120] L6-->L7: Formula: (= 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[] {694#false} is VALID [2022-04-27 22:19:12,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-27 22:19:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:12,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:12,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891856747] [2022-04-27 22:19:12,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891856747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:19:12,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851404825] [2022-04-27 22:19:12,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:19:12,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:19:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:19:12,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:19:12,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:19:12,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 22:19:12,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:19:12,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 22:19:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:12,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:19:12,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {693#true} is VALID [2022-04-27 22:19:12,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {693#true} is VALID [2022-04-27 22:19:12,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {698#(= main_~v~0 0)} is VALID [2022-04-27 22:19:12,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {698#(= main_~v~0 0)} is VALID [2022-04-27 22:19:12,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 22:19:12,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 22:19:12,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 22:19:12,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 22:19:12,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 22:19:12,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 22:19:12,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {758#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 22:19:12,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {758#(and (<= main_~v~0 4) (<= 4 main_~v~0))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-27 22:19:12,814 INFO L272 TraceCheckUtils]: 19: Hoare triple {694#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {694#false} is VALID [2022-04-27 22:19:12,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {694#false} is VALID [2022-04-27 22:19:12,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#false} [120] L6-->L7: Formula: (= 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[] {694#false} is VALID [2022-04-27 22:19:12,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-27 22:19:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:12,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:19:12,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-27 22:19:12,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#false} [120] L6-->L7: Formula: (= 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[] {694#false} is VALID [2022-04-27 22:19:12,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {694#false} is VALID [2022-04-27 22:19:12,949 INFO L272 TraceCheckUtils]: 19: Hoare triple {694#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {694#false} is VALID [2022-04-27 22:19:12,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {786#(< (mod main_~v~0 4294967296) 10)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-27 22:19:12,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#(< (mod (+ main_~v~0 1) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {786#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-27 22:19:12,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#(< (mod (+ main_~v~0 1) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {790#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 22:19:12,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#(< (mod (+ main_~v~0 2) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {790#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 22:19:12,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#(< (mod (+ main_~v~0 2) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {797#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-27 22:19:12,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#(< (mod (+ main_~v~0 3) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {797#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-27 22:19:12,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {804#(< (mod (+ main_~v~0 3) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {804#(< (mod (+ main_~v~0 3) 4294967296) 10)} is VALID [2022-04-27 22:19:12,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {811#(< (mod (+ main_~v~0 4) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {804#(< (mod (+ main_~v~0 3) 4294967296) 10)} is VALID [2022-04-27 22:19:12,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {811#(< (mod (+ main_~v~0 4) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {811#(< (mod (+ main_~v~0 4) 4294967296) 10)} is VALID [2022-04-27 22:19:12,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {811#(< (mod (+ main_~v~0 4) 4294967296) 10)} is VALID [2022-04-27 22:19:12,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {693#true} is VALID [2022-04-27 22:19:12,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {693#true} is VALID [2022-04-27 22:19:12,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {693#true} is VALID [2022-04-27 22:19:12,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {693#true} is VALID [2022-04-27 22:19:12,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {693#true} is VALID [2022-04-27 22:19:12,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-27 22:19:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851404825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:19:12,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:19:12,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 22:19:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499228304] [2022-04-27 22:19:12,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:19:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 22:19:12,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:12,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:13,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:13,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 22:19:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 22:19:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:19:13,005 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:13,587 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-04-27 22:19:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 22:19:13,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 22:19:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-04-27 22:19:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-04-27 22:19:13,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 83 transitions. [2022-04-27 22:19:13,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:13,660 INFO L225 Difference]: With dead ends: 73 [2022-04-27 22:19:13,660 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 22:19:13,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 22:19:13,661 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:13,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 56 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:19:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 22:19:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-04-27 22:19:13,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:13,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:13,674 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:13,674 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:13,676 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 22:19:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-27 22:19:13,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:13,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:13,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-27 22:19:13,676 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-27 22:19:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:13,677 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 22:19:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-27 22:19:13,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:13,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:13,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:13,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:19:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 22:19:13,679 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-04-27 22:19:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:13,679 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 22:19:13,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 22:19:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 22:19:13,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:13,680 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:13,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 22:19:13,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 22:19:13,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:13,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash -607664937, now seen corresponding path program 3 times [2022-04-27 22:19:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:13,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150002707] [2022-04-27 22:19:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:14,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {1156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1138#true} is VALID [2022-04-27 22:19:14,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1138#true} {1138#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {1138#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:14,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {1156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {1138#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {1138#true} is VALID [2022-04-27 22:19:14,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {1138#true} is VALID [2022-04-27 22:19:14,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1138#true} is VALID [2022-04-27 22:19:14,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {1143#(= main_~v~0 0)} is VALID [2022-04-27 22:19:14,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {1143#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1143#(= main_~v~0 0)} is VALID [2022-04-27 22:19:14,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {1143#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 22:19:14,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 22:19:14,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 22:19:14,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 22:19:14,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 22:19:14,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 22:19:14,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 22:19:14,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 22:19:14,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 22:19:14,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 22:19:14,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 22:19:14,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 22:19:14,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 22:19:14,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 22:19:14,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 22:19:14,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 22:19:14,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 22:19:14,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 22:19:14,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1153#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} is VALID [2022-04-27 22:19:14,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1153#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} is VALID [2022-04-27 22:19:14,136 INFO L272 TraceCheckUtils]: 31: Hoare triple {1153#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {1154#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} is VALID [2022-04-27 22:19:14,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {1154#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1155#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} is VALID [2022-04-27 22:19:14,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {1155#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} [120] L6-->L7: Formula: (= 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[] {1139#false} is VALID [2022-04-27 22:19:14,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {1139#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#false} is VALID [2022-04-27 22:19:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:14,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150002707] [2022-04-27 22:19:14,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150002707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:19:14,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121141379] [2022-04-27 22:19:14,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 22:19:14,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:19:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:19:14,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:19:14,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 22:19:14,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 22:19:14,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:19:14,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 22:19:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:14,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:19:14,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {1138#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} [92] 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1138#true} is VALID [2022-04-27 22:19:14,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {1138#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1138#true} is VALID [2022-04-27 22:19:14,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {1138#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1138#true} is VALID [2022-04-27 22:19:14,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {1138#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1244#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-27 22:19:14,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {1244#(< (mod main_~v~0 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1248#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} is VALID [2022-04-27 22:19:14,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {1248#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1252#(and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} is VALID [2022-04-27 22:19:14,689 INFO L272 TraceCheckUtils]: 31: Hoare triple {1252#(and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {1256#(and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ |__VERIFIER_assert_#in~cond| 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10) (not (< (mod (+ |__VERIFIER_assert_#in~cond| (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10)))) (< |__VERIFIER_assert_#in~cond| 4))} is VALID [2022-04-27 22:19:14,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {1256#(and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ |__VERIFIER_assert_#in~cond| 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10) (not (< (mod (+ |__VERIFIER_assert_#in~cond| (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10)))) (< |__VERIFIER_assert_#in~cond| 4))} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1260#(and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (not (< (mod (+ (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10)) (< (mod (+ 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10))))} is VALID [2022-04-27 22:19:14,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {1260#(and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (not (< (mod (+ (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10)) (< (mod (+ 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10))))} [120] L6-->L7: Formula: (= 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[] {1139#false} is VALID [2022-04-27 22:19:14,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {1139#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#false} is VALID [2022-04-27 22:19:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 22:19:14,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:19:14,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121141379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:14,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:19:14,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2022-04-27 22:19:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929296490] [2022-04-27 22:19:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:14,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 22:19:14,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:14,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:14,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:14,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 22:19:14,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:14,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 22:19:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 22:19:14,718 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:14,897 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 22:19:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 22:19:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 22:19:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 22:19:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 22:19:14,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 22:19:14,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:14,928 INFO L225 Difference]: With dead ends: 49 [2022-04-27 22:19:14,928 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:19:14,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-27 22:19:14,929 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:14,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-04-27 22:19:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:19:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:19:14,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:14,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:19:14,930 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:19:14,930 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:19:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:14,930 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:19:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:19:14,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:14,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:14,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:19:14,931 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:19:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:14,931 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:19:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:19:14,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:14,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:14,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:14,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:19:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:19:14,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-27 22:19:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:14,931 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:19:14,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:19:14,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:14,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:19:14,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 22:19:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:19:15,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:19:15,262 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:19:15,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:19:15,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:19:15,262 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:19:15,262 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:19:15,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:19:15,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:19:15,262 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-04-27 22:19:15,262 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L19-4(lines 19 25) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 25) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (or (< (mod main_~v~0 4294967296) 10) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L895 garLoopResultBuilder]: At program point L23-3(line 23) the Hoare annotation is: (or (= main_~v~0 0) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-27 22:19:15,263 INFO L895 garLoopResultBuilder]: At program point L23-4(line 23) the Hoare annotation is: (and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10)) [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L23-2(line 23) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L24(lines 22 25) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 22:19:15,263 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 22:19:15,264 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 22:19:15,264 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 22:19:15,265 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 22:19:15,267 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:19:15,271 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:19:15,271 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 22:19:15,272 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:19:15,272 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-27 22:19:15,272 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-27 22:19:15,273 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 22:19:15,273 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 22:19:15,273 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:19:15,273 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-27 22:19:15,273 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 22:19:15,273 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 22:19:15,274 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 22:19:15,275 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:19:15,275 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:19:15,275 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 22:19:15,275 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 22:19:15,275 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 22:19:15,276 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 22:19:15,276 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:19:15,276 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 22:19:15,277 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 22:19:15,278 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 22:19:15,278 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:19:15,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:15 BasicIcfg [2022-04-27 22:19:15,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:19:15,286 INFO L158 Benchmark]: Toolchain (without parser) took 5062.95ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 145.6MB in the beginning and 92.9MB in the end (delta: 52.7MB). Peak memory consumption was 114.0MB. Max. memory is 8.0GB. [2022-04-27 22:19:15,286 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory was 161.9MB in the beginning and 161.8MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:19:15,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.19ms. Allocated memory is still 196.1MB. Free memory was 145.4MB in the beginning and 172.7MB in the end (delta: -27.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-27 22:19:15,286 INFO L158 Benchmark]: Boogie Preprocessor took 19.16ms. Allocated memory is still 196.1MB. Free memory was 172.2MB in the beginning and 170.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:19:15,286 INFO L158 Benchmark]: RCFGBuilder took 276.77ms. Allocated memory is still 196.1MB. Free memory was 170.7MB in the beginning and 158.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 22:19:15,286 INFO L158 Benchmark]: IcfgTransformer took 46.92ms. Allocated memory is still 196.1MB. Free memory was 158.6MB in the beginning and 157.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:19:15,287 INFO L158 Benchmark]: TraceAbstraction took 4556.81ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 156.5MB in the beginning and 93.4MB in the end (delta: 63.1MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. [2022-04-27 22:19:15,288 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory was 161.9MB in the beginning and 161.8MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 158.19ms. Allocated memory is still 196.1MB. Free memory was 145.4MB in the beginning and 172.7MB in the end (delta: -27.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.16ms. Allocated memory is still 196.1MB. Free memory was 172.2MB in the beginning and 170.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.77ms. Allocated memory is still 196.1MB. Free memory was 170.7MB in the beginning and 158.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 46.92ms. Allocated memory is still 196.1MB. Free memory was 158.6MB in the beginning and 157.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4556.81ms. Allocated memory was 196.1MB in the beginning and 255.9MB in the end (delta: 59.8MB). Free memory was 156.5MB in the beginning and 93.4MB in the end (delta: 63.1MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 133 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 15 PreInvPairs, 35 NumberOfFragments, 88 HoareAnnotationTreeSize, 15 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 256 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 180 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 210 ConstructedInterpolants, 2 QuantifiedInterpolants, 651 SizeOfPredicates, 4 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 100/251 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: v == 0 || (v + 4294967295) % 4294967296 < 10 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: v % 4294967296 < 10 || (v + 4294967295) % 4294967296 < 10 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:19:15,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...