/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/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:21:03,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:21:03,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:21:03,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:21:03,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:21:03,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:21:03,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:21:03,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:21:03,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:21:03,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:21:03,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:21:03,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:21:03,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:21:03,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:21:03,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:21:03,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:21:03,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:21:03,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:21:03,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:21:03,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:21:03,182 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:21:03,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:21:03,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:21:03,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:21:03,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:21:03,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:21:03,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:21:03,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:21:03,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:21:03,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:21:03,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:21:03,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:21:03,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:21:03,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:21:03,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:21:03,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:21:03,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:21:03,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:21:03,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:21:03,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:21:03,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:21:03,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:21:03,201 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:21:03,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:21:03,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:21:03,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:21:03,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:21:03,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:21:03,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:21:03,229 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:21:03,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:21:03,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:21:03,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:21:03,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:21:03,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:21:03,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:21:03,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:21:03,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:21:03,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:21:03,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:21:03,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:21:03,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:21:03,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:21:03,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:21:03,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:21:03,233 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:21:03,233 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:21:03,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:21:03,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:21:03,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:21:03,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:21:03,446 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:21:03,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-27 22:21:03,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168c50dfa/77328a2eaf2a48b98a7efaa7197a5b13/FLAG766f1cefe [2022-04-27 22:21:03,816 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:21:03,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-27 22:21:03,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168c50dfa/77328a2eaf2a48b98a7efaa7197a5b13/FLAG766f1cefe [2022-04-27 22:21:04,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168c50dfa/77328a2eaf2a48b98a7efaa7197a5b13 [2022-04-27 22:21:04,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:21:04,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:21:04,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:21:04,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:21:04,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:21:04,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe733e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04, skipping insertion in model container [2022-04-27 22:21:04,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:21:04,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:21:04,424 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/sumt3.c[403,416] [2022-04-27 22:21:04,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:21:04,442 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:21:04,454 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/sumt3.c[403,416] [2022-04-27 22:21:04,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:21:04,475 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:21:04,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04 WrapperNode [2022-04-27 22:21:04,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:21:04,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:21:04,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:21:04,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:21:04,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:21:04,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:21:04,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:21:04,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:21:04,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (1/1) ... [2022-04-27 22:21:04,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:21:04,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:21:04,541 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:21:04,548 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:21:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:21:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:21:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:21:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:21:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:21:04,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 22:21:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:21:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:21:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:21:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:21:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:21:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:21:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:21:04,627 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:21:04,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:21:06,914 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:21:06,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:21:06,920 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:21:06,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:06 BoogieIcfgContainer [2022-04-27 22:21:06,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:21:06,923 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:21:06,923 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:21:06,924 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:21:06,929 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:06" (1/1) ... [2022-04-27 22:21:06,930 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:21:06,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:21:06 BasicIcfg [2022-04-27 22:21:06,947 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:21:06,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:21:06,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:21:06,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:21:06,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:21:04" (1/4) ... [2022-04-27 22:21:06,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319c7149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:06, skipping insertion in model container [2022-04-27 22:21:06,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:04" (2/4) ... [2022-04-27 22:21:06,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319c7149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:06, skipping insertion in model container [2022-04-27 22:21:06,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:06" (3/4) ... [2022-04-27 22:21:06,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319c7149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:21:06, skipping insertion in model container [2022-04-27 22:21:06,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:21:06" (4/4) ... [2022-04-27 22:21:06,954 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.cqvasr [2022-04-27 22:21:06,966 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:21:06,967 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:21:07,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:21:07,008 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@60f24c58, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32c7356d [2022-04-27 22:21:07,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:21:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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:21:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:21:07,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:21:07,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:21:07,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:21:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:21:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1944242814, now seen corresponding path program 1 times [2022-04-27 22:21:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:21:07,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564377617] [2022-04-27 22:21:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:21:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:21:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:07,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 22:21:07,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 22:21:07,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 22:21:07,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:21:07,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 22:21:07,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 22:21:07,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 22:21:07,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 22:21:07,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {26#true} is VALID [2022-04-27 22:21:07,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {26#true} is VALID [2022-04-27 22:21:07,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} [73] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 22:21:07,180 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {27#false} is VALID [2022-04-27 22:21:07,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-27 22:21:07,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 22:21:07,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 22:21:07,181 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:21:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:21:07,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564377617] [2022-04-27 22:21:07,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564377617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:21:07,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:21:07,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:21:07,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517190103] [2022-04-27 22:21:07,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:21:07,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:21:07,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:21:07,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:07,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:07,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:21:07,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:21:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:21:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:21:07,230 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:09,508 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 22:21:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:21:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:21:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:21:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-27 22:21:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-27 22:21:09,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-27 22:21:09,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:09,577 INFO L225 Difference]: With dead ends: 35 [2022-04-27 22:21:09,577 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 22:21:09,580 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:21:09,583 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:21:09,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:21:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 22:21:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 22:21:09,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:21:09,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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:21:09,608 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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:21:09,608 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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:21:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:09,610 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 22:21:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:21:09,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:09,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:09,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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) Second operand 16 states. [2022-04-27 22:21:09,611 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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) Second operand 16 states. [2022-04-27 22:21:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:09,613 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 22:21:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:21:09,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:09,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:09,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:21:09,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:21:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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:21:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-27 22:21:09,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-27 22:21:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:21:09,617 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-27 22:21:09,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:21:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:21:09,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:21:09,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:21:09,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:21:09,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:21:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:21:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1943319293, now seen corresponding path program 1 times [2022-04-27 22:21:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:21:09,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625207092] [2022-04-27 22:21:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:21:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:21:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:09,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {133#true} is VALID [2022-04-27 22:21:09,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 22:21:09,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 22:21:09,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {133#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:21:09,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {133#true} is VALID [2022-04-27 22:21:09,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 22:21:09,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133#true} {133#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 22:21:09,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {133#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 22:21:09,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {133#true} is VALID [2022-04-27 22:21:09,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {138#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:09,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {138#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:09,898 INFO L272 TraceCheckUtils]: 8: Hoare triple {138#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:21:09,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {140#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:21:09,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#(not (= __VERIFIER_assert_~cond 0))} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {134#false} is VALID [2022-04-27 22:21:09,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#false} is VALID [2022-04-27 22:21:09,900 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:21:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:21:09,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625207092] [2022-04-27 22:21:09,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625207092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:21:09,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:21:09,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:21:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539726026] [2022-04-27 22:21:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:21:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:21:09,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:21:09,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:09,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:09,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:21:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:21:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:21:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:21:09,915 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:12,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:21:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:12,296 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-27 22:21:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:21:12,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:21:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:21:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-27 22:21:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-27 22:21:12,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-27 22:21:12,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:12,332 INFO L225 Difference]: With dead ends: 23 [2022-04-27 22:21:12,332 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 22:21:12,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:21:12,334 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:21:12,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 22:21:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 22:21:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 22:21:12,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:21:12,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:21:12,339 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:21:12,339 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:21:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:12,340 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 22:21:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 22:21:12,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:12,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:12,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-27 22:21:12,341 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-27 22:21:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:12,343 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 22:21:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 22:21:12,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:12,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:12,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:21:12,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:21:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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:21:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 22:21:12,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-27 22:21:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:21:12,345 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 22:21:12,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 22:21:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 22:21:12,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:21:12,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:21:12,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:21:12,347 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:21:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:21:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1088614638, now seen corresponding path program 1 times [2022-04-27 22:21:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:21:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417320304] [2022-04-27 22:21:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:21:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:21:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:12,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {244#true} is VALID [2022-04-27 22:21:12,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:12,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:12,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:21:12,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {244#true} is VALID [2022-04-27 22:21:12,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:12,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:12,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:12,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {244#true} is VALID [2022-04-27 22:21:12,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {249#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:12,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {250#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-27 22:21:12,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {251#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} is VALID [2022-04-27 22:21:12,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {252#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-27 22:21:12,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {253#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-27 22:21:12,889 INFO L272 TraceCheckUtils]: 11: Hoare triple {253#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {254#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:21:12,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {255#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:21:12,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#(not (= __VERIFIER_assert_~cond 0))} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:21:12,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {245#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:21:12,891 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:21:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:21:12,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417320304] [2022-04-27 22:21:12,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417320304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:21:12,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386568279] [2022-04-27 22:21:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:12,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:21:12,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:21:12,894 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:21:12,922 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:21:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:12,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 22:21:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:12,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:21:13,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:13,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {244#true} is VALID [2022-04-27 22:21:13,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:13,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:13,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:13,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {244#true} is VALID [2022-04-27 22:21:13,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {249#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:13,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {249#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:13,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {284#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:13,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {288#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:13,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {288#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {288#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:13,307 INFO L272 TraceCheckUtils]: 11: Hoare triple {288#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:21:13,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:21:13,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {299#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:21:13,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {245#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:21:13,313 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:21:13,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:21:13,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {245#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:21:13,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {299#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:21:13,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:21:13,592 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:21:13,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:13,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {322#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:15,698 WARN L290 TraceCheckUtils]: 8: Hoare triple {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {322#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:21:15,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:15,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {315#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:15,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {244#true} is VALID [2022-04-27 22:21:15,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:15,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:15,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:15,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {244#true} is VALID [2022-04-27 22:21:15,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:21:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:21:15,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386568279] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:21:15,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:21:15,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-27 22:21:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972016808] [2022-04-27 22:21:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:21:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:21:15,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:21:15,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:17,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:17,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:21:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:21:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:21:17,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 22:21:17,842 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:19,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:21:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:22,309 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 22:21:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:21:22,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:21:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:21:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 22:21:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 22:21:22,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-27 22:21:24,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:24,448 INFO L225 Difference]: With dead ends: 25 [2022-04-27 22:21:24,448 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 22:21:24,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-27 22:21:24,450 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:21:24,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 22:21:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 22:21:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-27 22:21:24,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:21:24,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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:21:24,454 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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:21:24,454 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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:21:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:24,455 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 22:21:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 22:21:24,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:24,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:24,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) Second operand 20 states. [2022-04-27 22:21:24,456 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) Second operand 20 states. [2022-04-27 22:21:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:24,457 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 22:21:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 22:21:24,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:24,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:24,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:21:24,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:21:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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:21:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-27 22:21:24,459 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2022-04-27 22:21:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:21:24,459 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-27 22:21:24,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:21:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 22:21:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 22:21:24,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:21:24,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:21:24,487 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:21:24,663 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:21:24,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:21:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:21:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2078903839, now seen corresponding path program 1 times [2022-04-27 22:21:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:21:24,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139431938] [2022-04-27 22:21:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:21:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:24,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:21:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:24,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {457#true} is VALID [2022-04-27 22:21:24,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#true} is VALID [2022-04-27 22:21:24,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#true} is VALID [2022-04-27 22:21:24,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:21:24,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {457#true} is VALID [2022-04-27 22:21:24,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#true} is VALID [2022-04-27 22:21:24,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#true} is VALID [2022-04-27 22:21:24,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#true} is VALID [2022-04-27 22:21:24,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {457#true} is VALID [2022-04-27 22:21:24,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {462#(= main_~l~0 0)} is VALID [2022-04-27 22:21:24,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(= main_~l~0 0)} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {462#(= main_~l~0 0)} is VALID [2022-04-27 22:21:24,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(= main_~l~0 0)} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {458#false} is VALID [2022-04-27 22:21:24,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {458#false} is VALID [2022-04-27 22:21:24,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {458#false} is VALID [2022-04-27 22:21:24,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {458#false} is VALID [2022-04-27 22:21:24,872 INFO L272 TraceCheckUtils]: 12: Hoare triple {458#false} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {458#false} is VALID [2022-04-27 22:21:24,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#false} is VALID [2022-04-27 22:21:24,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#false} is VALID [2022-04-27 22:21:24,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#false} is VALID [2022-04-27 22:21:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:21:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:21:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139431938] [2022-04-27 22:21:24,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139431938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:21:24,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:21:24,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 22:21:24,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679646906] [2022-04-27 22:21:24,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:21:24,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-04-27 22:21:24,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:21:24,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:21:27,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:27,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 22:21:27,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:21:27,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 22:21:27,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 22:21:27,051 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:21:31,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:21:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:31,491 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 22:21:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 22:21:31,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-04-27 22:21:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:21:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:21:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 22:21:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:21:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 22:21:31,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-27 22:21:33,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:33,681 INFO L225 Difference]: With dead ends: 31 [2022-04-27 22:21:33,682 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 22:21:33,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:21:33,683 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:21:33,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 22:21:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 22:21:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 22:21:33,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:21:33,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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:21:33,687 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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:21:33,687 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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:21:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:33,688 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-27 22:21:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 22:21:33,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:33,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:33,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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) Second operand 22 states. [2022-04-27 22:21:33,689 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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) Second operand 22 states. [2022-04-27 22:21:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:33,690 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-27 22:21:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 22:21:33,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:33,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:33,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:21:33,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:21:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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:21:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-27 22:21:33,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2022-04-27 22:21:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:21:33,692 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-27 22:21:33,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:21:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 22:21:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 22:21:33,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:21:33,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:21:33,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 22:21:33,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:21:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:21:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 187967564, now seen corresponding path program 1 times [2022-04-27 22:21:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:21:33,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612519235] [2022-04-27 22:21:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:21:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:21:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:33,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {593#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {586#true} is VALID [2022-04-27 22:21:33,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:33,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {586#true} {586#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:33,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:21:33,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {586#true} is VALID [2022-04-27 22:21:33,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:33,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:33,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:33,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {586#true} is VALID [2022-04-27 22:21:33,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {591#(= main_~l~0 0)} is VALID [2022-04-27 22:21:33,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~l~0 0)} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {591#(= main_~l~0 0)} is VALID [2022-04-27 22:21:33,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~l~0 0)} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {591#(= main_~l~0 0)} is VALID [2022-04-27 22:21:33,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {591#(= main_~l~0 0)} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {592#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:21:33,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {592#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:21:33,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {592#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:21:33,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {592#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {587#false} is VALID [2022-04-27 22:21:33,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {587#false} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {587#false} is VALID [2022-04-27 22:21:33,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {587#false} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:33,783 INFO L272 TraceCheckUtils]: 15: Hoare triple {587#false} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {587#false} is VALID [2022-04-27 22:21:33,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {587#false} is VALID [2022-04-27 22:21:33,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {587#false} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:33,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:21:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:21:33,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612519235] [2022-04-27 22:21:33,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612519235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:21:33,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802195925] [2022-04-27 22:21:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:21:33,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:21:33,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:21:33,786 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:21:33,790 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:21:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:33,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 22:21:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:21:33,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:21:34,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:34,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {586#true} is VALID [2022-04-27 22:21:34,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:34,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:34,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:34,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {586#true} is VALID [2022-04-27 22:21:34,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {615#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:34,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {615#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {615#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:21:34,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {615#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {622#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {626#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {626#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {626#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {626#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {636#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {640#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {640#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:21:34,146 INFO L272 TraceCheckUtils]: 15: Hoare triple {640#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {647#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:21:34,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {647#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {651#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:21:34,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {651#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:34,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:21:34,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:21:34,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:34,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {651#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {587#false} is VALID [2022-04-27 22:21:34,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {647#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {651#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:21:34,408 INFO L272 TraceCheckUtils]: 15: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {647#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:21:34,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:34,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:34,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {674#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:21:34,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:34,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:34,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:36,546 WARN L290 TraceCheckUtils]: 8: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {674#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:21:36,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:36,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {667#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:21:36,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {586#true} is VALID [2022-04-27 22:21:36,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:36,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {586#true} {586#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:36,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:36,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {586#true} is VALID [2022-04-27 22:21:36,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {586#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#true} is VALID [2022-04-27 22:21:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 22:21:36,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802195925] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:21:36,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:21:36,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-27 22:21:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650337792] [2022-04-27 22:21:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:21:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-27 22:21:36,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:21:36,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:21:38,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:38,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:21:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:21:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:21:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:21:38,702 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:21:40,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:21:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:41,048 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 22:21:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:21:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-27 22:21:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:21:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:21:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 22:21:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:21:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 22:21:41,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-27 22:21:43,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:21:43,234 INFO L225 Difference]: With dead ends: 21 [2022-04-27 22:21:43,234 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:21:43,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-27 22:21:43,235 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:21:43,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 22:21:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:21:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:21:43,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:21:43,236 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:21:43,236 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:21:43,236 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:21:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:43,237 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:21:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:21:43,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:43,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:43,237 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:21:43,237 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:21:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:21:43,237 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:21:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:21:43,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:43,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:21:43,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:21:43,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:21:43,238 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:21:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:21:43,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-27 22:21:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:21:43,238 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:21:43,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:21:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:21:43,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:21:43,241 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:21:43,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 22:21:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:21:43,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:21:43,540 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:21:43,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:21:43,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:21:43,540 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:21:43,540 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 36) the Hoare annotation is: true [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 36) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 33) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 36) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 33) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point L28-2(lines 26 31) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 31) no Hoare annotation was computed. [2022-04-27 22:21:43,541 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-27 22:21:43,542 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-27 22:21:43,542 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 22:21:43,542 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-27 22:21:43,542 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-27 22:21:43,542 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-27 22:21:43,544 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 22:21:43,546 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:21:43,549 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:21:43,549 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 22:21:43,549 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:21:43,550 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2022-04-27 22:21:43,551 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 22:21:43,552 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 22:21:43,552 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 22:21:43,552 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:21:43,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:21:43 BasicIcfg [2022-04-27 22:21:43,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:21:43,561 INFO L158 Benchmark]: Toolchain (without parser) took 39298.60ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 129.7MB in the beginning and 198.5MB in the end (delta: -68.7MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. [2022-04-27 22:21:43,561 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:21:43,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.00ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 129.5MB in the beginning and 201.5MB in the end (delta: -72.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 22:21:43,562 INFO L158 Benchmark]: Boogie Preprocessor took 36.45ms. Allocated memory is still 229.6MB. Free memory was 201.5MB in the beginning and 199.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:21:43,562 INFO L158 Benchmark]: RCFGBuilder took 2408.05ms. Allocated memory is still 229.6MB. Free memory was 199.7MB in the beginning and 187.4MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 22:21:43,562 INFO L158 Benchmark]: IcfgTransformer took 24.55ms. Allocated memory is still 229.6MB. Free memory was 187.4MB in the beginning and 185.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:21:43,562 INFO L158 Benchmark]: TraceAbstraction took 36611.41ms. Allocated memory is still 229.6MB. Free memory was 185.3MB in the beginning and 198.5MB in the end (delta: -13.2MB). Peak memory consumption was 114.2MB. Max. memory is 8.0GB. [2022-04-27 22:21:43,563 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.11ms. Allocated memory is still 185.6MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.00ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 129.5MB in the beginning and 201.5MB in the end (delta: -72.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.45ms. Allocated memory is still 229.6MB. Free memory was 201.5MB in the beginning and 199.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2408.05ms. Allocated memory is still 229.6MB. Free memory was 199.7MB in the beginning and 187.4MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 24.55ms. Allocated memory is still 229.6MB. Free memory was 187.4MB in the beginning and 185.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 36611.41ms. Allocated memory is still 229.6MB. Free memory was 185.3MB in the beginning and 198.5MB in the end (delta: -13.2MB). Peak memory consumption was 114.2MB. 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: 10]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 69 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 34 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 2 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/19 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: 24]: Loop Invariant Derived loop invariant: (i + k + j) % 4294967296 == l % 4294967296 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:21:43,587 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...