/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/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:20:22,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:20:22,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:20:22,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:20:22,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:20:22,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:20:22,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:20:22,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:20:22,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:20:22,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:20:22,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:20:22,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:20:22,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:20:22,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:20:22,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:20:22,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:20:22,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:20:22,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:20:22,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:20:22,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:20:22,282 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:20:22,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:20:22,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:20:22,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:20:22,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:20:22,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:20:22,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:20:22,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:20:22,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:20:22,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:20:22,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:20:22,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:20:22,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:20:22,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:20:22,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:20:22,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:20:22,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:20:22,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:20:22,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:20:22,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:20:22,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:20:22,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:20:22,306 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 21:20:22,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:20:22,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:20:22,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:20:22,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:20:22,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:20:22,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:20:22,343 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:20:22,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:20:22,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:20:22,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:20:22,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:20:22,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:20:22,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:20:22,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:20:22,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:20:22,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:20:22,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:20:22,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:20:22,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:20:22,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:20:22,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:20:22,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:20:22,349 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:20:22,349 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 21:20:22,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:20:22,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:20:22,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:20:22,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:20:22,573 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:20:22,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-27 21:20:22,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663ac08fd/5d4e384124d84af181f58d97a8bd8a9b/FLAG837a90287 [2022-04-27 21:20:23,014 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:20:23,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-27 21:20:23,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663ac08fd/5d4e384124d84af181f58d97a8bd8a9b/FLAG837a90287 [2022-04-27 21:20:23,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663ac08fd/5d4e384124d84af181f58d97a8bd8a9b [2022-04-27 21:20:23,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:20:23,035 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:20:23,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:20:23,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:20:23,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:20:23,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604ed455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23, skipping insertion in model container [2022-04-27 21:20:23,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:20:23,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:20:23,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-27 21:20:23,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:20:23,281 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:20:23,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-27 21:20:23,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:20:23,309 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:20:23,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23 WrapperNode [2022-04-27 21:20:23,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:20:23,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:20:23,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:20:23,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:20:23,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:20:23,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:20:23,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:20:23,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:20:23,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:20:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:23,374 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 21:20:23,376 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 21:20:23,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:20:23,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:20:23,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:20:23,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:20:23,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:20:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:20:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:20:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:20:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:20:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:20:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:20:23,477 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:20:23,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:20:23,656 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:20:23,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:20:23,662 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:20:23,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:23 BoogieIcfgContainer [2022-04-27 21:20:23,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:20:23,664 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:20:23,664 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:20:23,665 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:20:23,667 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:23" (1/1) ... [2022-04-27 21:20:23,668 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:20:23,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:20:23 BasicIcfg [2022-04-27 21:20:23,687 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:20:23,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:20:23,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:20:23,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:20:23,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:20:23" (1/4) ... [2022-04-27 21:20:23,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643999ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:20:23, skipping insertion in model container [2022-04-27 21:20:23,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:23" (2/4) ... [2022-04-27 21:20:23,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643999ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:20:23, skipping insertion in model container [2022-04-27 21:20:23,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:23" (3/4) ... [2022-04-27 21:20:23,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643999ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:20:23, skipping insertion in model container [2022-04-27 21:20:23,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:20:23" (4/4) ... [2022-04-27 21:20:23,694 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.cqvasr [2022-04-27 21:20:23,708 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:20:23,708 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:20:23,749 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:20:23,756 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@3e2e70dc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c833921 [2022-04-27 21:20:23,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:20:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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 21:20:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:20:23,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:23,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:23,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash -935980469, now seen corresponding path program 1 times [2022-04-27 21:20:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:23,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199548728] [2022-04-27 21:20:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:24,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:24,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 21:20:24,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:20:24,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:20:24,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:24,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 21:20:24,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:20:24,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:20:24,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:20:24,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {31#true} is VALID [2022-04-27 21:20:24,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} [105] L45-1-->L17-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 21:20:24,048 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {32#false} is VALID [2022-04-27 21:20:24,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {32#false} is VALID [2022-04-27 21:20:24,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 21:20:24,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 21:20:24,050 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 21:20:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199548728] [2022-04-27 21:20:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199548728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:24,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:24,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:20:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772430569] [2022-04-27 21:20:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:24,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 21:20:24,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:24,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 21:20:24,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:24,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:20:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:20:24,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:20:24,112 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 21:20:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:24,256 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-27 21:20:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:20:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 21:20:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 21:20:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 21:20:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 21:20:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 21:20:24,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-27 21:20:24,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:24,367 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:20:24,367 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 21:20:24,371 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 21:20:24,374 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:24,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 21:20:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 21:20:24,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:24,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 21:20:24,410 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 21:20:24,411 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 21:20:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:24,419 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-27 21:20:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 21:20:24,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:24,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:24,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 21:20:24,421 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 21:20:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:24,424 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-27 21:20:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 21:20:24,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:24,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:24,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:24,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 21:20:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-27 21:20:24,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-27 21:20:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:24,432 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-27 21:20:24,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 21:20:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 21:20:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:20:24,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:24,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:24,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:20:24,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -935056948, now seen corresponding path program 1 times [2022-04-27 21:20:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:24,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000113835] [2022-04-27 21:20:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:24,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:24,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {160#true} is VALID [2022-04-27 21:20:24,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#true} is VALID [2022-04-27 21:20:24,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#true} is VALID [2022-04-27 21:20:24,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:24,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {160#true} is VALID [2022-04-27 21:20:24,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#true} is VALID [2022-04-27 21:20:24,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#true} is VALID [2022-04-27 21:20:24,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#true} is VALID [2022-04-27 21:20:24,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {165#(= main_~x~0 0)} is VALID [2022-04-27 21:20:24,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(= main_~x~0 0)} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {161#false} is VALID [2022-04-27 21:20:24,616 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {161#false} is VALID [2022-04-27 21:20:24,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {161#false} is VALID [2022-04-27 21:20:24,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {161#false} is VALID [2022-04-27 21:20:24,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#false} is VALID [2022-04-27 21:20:24,617 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 21:20:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:24,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000113835] [2022-04-27 21:20:24,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000113835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:24,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:24,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:20:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431065420] [2022-04-27 21:20:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 21:20:24,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:24,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 21:20:24,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:24,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:20:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:20:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:20:24,641 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 21:20:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:24,785 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-27 21:20:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:20:24,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 21:20:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 21:20:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-27 21:20:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 21:20:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-27 21:20:24,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-27 21:20:24,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:24,842 INFO L225 Difference]: With dead ends: 29 [2022-04-27 21:20:24,842 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 21:20:24,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:20:24,845 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:24,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 21:20:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-27 21:20:24,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:24,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 21:20:24,852 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 21:20:24,852 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 21:20:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:24,853 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 21:20:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-27 21:20:24,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:24,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:24,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 24 states. [2022-04-27 21:20:24,855 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 24 states. [2022-04-27 21:20:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:24,856 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 21:20:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-27 21:20:24,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:24,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:24,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:24,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 21:20:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-27 21:20:24,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-27 21:20:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:24,858 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-27 21:20:24,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 21:20:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-27 21:20:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:20:24,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:24,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:24,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:20:24,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash 982716702, now seen corresponding path program 1 times [2022-04-27 21:20:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:24,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470418321] [2022-04-27 21:20:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:25,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {289#true} is VALID [2022-04-27 21:20:25,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289#true} {289#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {289#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:25,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {289#true} is VALID [2022-04-27 21:20:25,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {294#(= main_~x~0 0)} is VALID [2022-04-27 21:20:25,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {294#(= main_~x~0 0)} is VALID [2022-04-27 21:20:25,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(= main_~x~0 0)} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {295#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:20:25,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {296#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:20:25,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {297#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:20:25,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {297#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [122] L24-1-->L27-1: Formula: (and (= v_main_~x~0_23 (+ v_main_~x~0_24 2)) (= (mod v_main_~y~0_12 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[main_~x~0] {298#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:20:25,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {298#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {299#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:20:25,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {299#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [126] L30-1-->L33-1: Formula: (and (= (mod v_main_~y~0_16 2) 0) (= v_main_~x~0_31 (+ v_main_~x~0_32 2))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_31, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0] {300#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:20:25,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:20:25,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {302#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:20:25,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {302#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [132] L39-1-->L42-1: Formula: (and (= v_main_~x~0_43 (+ v_main_~x~0_44 2)) (= (mod v_main_~y~0_22 2) 0)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[main_~x~0] {303#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:20:25,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {303#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {304#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:20:25,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {304#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:25,203 INFO L272 TraceCheckUtils]: 18: Hoare triple {290#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {290#false} is VALID [2022-04-27 21:20:25,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {290#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {290#false} is VALID [2022-04-27 21:20:25,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {290#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:25,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {290#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:25,204 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 21:20:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:25,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470418321] [2022-04-27 21:20:25,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470418321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:20:25,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061260425] [2022-04-27 21:20:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:25,207 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 21:20:25,217 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 21:20:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:25,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 21:20:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:25,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:20:25,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {289#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {289#true} is VALID [2022-04-27 21:20:25,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:25,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {294#(= main_~x~0 0)} is VALID [2022-04-27 21:20:25,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {294#(= main_~x~0 0)} is VALID [2022-04-27 21:20:25,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(= main_~x~0 0)} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {295#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:20:25,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {296#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:20:25,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {297#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:20:25,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {297#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [122] L24-1-->L27-1: Formula: (and (= v_main_~x~0_23 (+ v_main_~x~0_24 2)) (= (mod v_main_~y~0_12 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[main_~x~0] {298#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:20:25,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {298#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {299#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:20:25,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {299#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [126] L30-1-->L33-1: Formula: (and (= (mod v_main_~y~0_16 2) 0) (= v_main_~x~0_31 (+ v_main_~x~0_32 2))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_31, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0] {300#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:20:25,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:20:25,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {302#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:20:25,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {302#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [132] L39-1-->L42-1: Formula: (and (= v_main_~x~0_43 (+ v_main_~x~0_44 2)) (= (mod v_main_~y~0_22 2) 0)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[main_~x~0] {303#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:20:25,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {303#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {357#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:20:25,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {357#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:25,728 INFO L272 TraceCheckUtils]: 18: Hoare triple {290#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {290#false} is VALID [2022-04-27 21:20:25,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {290#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {290#false} is VALID [2022-04-27 21:20:25,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {290#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:25,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {290#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:25,729 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 21:20:25,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:20:26,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {290#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:26,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {290#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:26,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {290#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {290#false} is VALID [2022-04-27 21:20:26,153 INFO L272 TraceCheckUtils]: 18: Hoare triple {290#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {290#false} is VALID [2022-04-27 21:20:26,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#(< (mod main_~x~0 4294967296) 99)} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {290#false} is VALID [2022-04-27 21:20:26,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {389#(< (mod (+ main_~x~0 2) 4294967296) 99)} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {385#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 21:20:26,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {393#(< (mod (+ main_~x~0 4) 4294967296) 99)} [132] L39-1-->L42-1: Formula: (and (= v_main_~x~0_43 (+ v_main_~x~0_44 2)) (= (mod v_main_~y~0_22 2) 0)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[main_~x~0] {389#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 21:20:26,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#(< (mod (+ main_~x~0 6) 4294967296) 99)} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {393#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 21:20:26,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(< (mod (+ main_~x~0 8) 4294967296) 99)} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {397#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 21:20:26,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {405#(< (mod (+ main_~x~0 10) 4294967296) 99)} [126] L30-1-->L33-1: Formula: (and (= (mod v_main_~y~0_16 2) 0) (= v_main_~x~0_31 (+ v_main_~x~0_32 2))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_31, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0] {401#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 21:20:26,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#(< (mod (+ main_~x~0 12) 4294967296) 99)} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {405#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 21:20:26,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(< (mod (+ main_~x~0 14) 4294967296) 99)} [122] L24-1-->L27-1: Formula: (and (= v_main_~x~0_23 (+ v_main_~x~0_24 2)) (= (mod v_main_~y~0_12 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[main_~x~0] {409#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 21:20:26,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(< (mod (+ main_~x~0 16) 4294967296) 99)} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {413#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 21:20:26,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(< (mod (+ main_~x~0 18) 4294967296) 99)} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {417#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 21:20:26,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#(< (mod (+ main_~x~0 20) 4294967296) 99)} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {421#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 21:20:26,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(< (mod (+ main_~x~0 20) 4294967296) 99)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {425#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 21:20:26,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {425#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 21:20:26,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:26,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:26,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:26,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {289#true} is VALID [2022-04-27 21:20:26,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {289#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-27 21:20:26,168 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 21:20:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061260425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:20:26,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:20:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 21:20:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910449803] [2022-04-27 21:20:26,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:20:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:20:26,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:26,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:26,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:26,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 21:20:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 21:20:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 21:20:26,208 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:50,728 INFO L93 Difference]: Finished difference Result 341 states and 660 transitions. [2022-04-27 21:20:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-27 21:20:50,728 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:20:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 659 transitions. [2022-04-27 21:20:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 659 transitions. [2022-04-27 21:20:50,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 659 transitions. [2022-04-27 21:20:52,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:52,658 INFO L225 Difference]: With dead ends: 341 [2022-04-27 21:20:52,658 INFO L226 Difference]: Without dead ends: 336 [2022-04-27 21:20:52,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1529, Invalid=4021, Unknown=0, NotChecked=0, Total=5550 [2022-04-27 21:20:52,661 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 234 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 1997 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 4778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1997 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:52,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 67 Invalid, 4778 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1997 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-27 21:20:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-27 21:20:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 272. [2022-04-27 21:20:52,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:52,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 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 21:20:52,726 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 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 21:20:52,727 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 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 21:20:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:52,743 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-27 21:20:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 634 transitions. [2022-04-27 21:20:52,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:52,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:52,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 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 336 states. [2022-04-27 21:20:52,748 INFO L87 Difference]: Start difference. First operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 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 336 states. [2022-04-27 21:20:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:52,768 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-27 21:20:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 634 transitions. [2022-04-27 21:20:52,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:52,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:52,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:52,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 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 21:20:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 510 transitions. [2022-04-27 21:20:52,789 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 510 transitions. Word has length 22 [2022-04-27 21:20:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:52,790 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 510 transitions. [2022-04-27 21:20:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 510 transitions. [2022-04-27 21:20:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:20:52,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:52,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:52,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:20:52,992 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 21:20:52,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1831418748, now seen corresponding path program 1 times [2022-04-27 21:20:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:52,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960124673] [2022-04-27 21:20:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1932#true} is VALID [2022-04-27 21:20:53,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1932#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-27 21:20:53,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1932#true} {1932#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-27 21:20:53,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {1932#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:53,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1932#true} is VALID [2022-04-27 21:20:53,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {1932#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-27 21:20:53,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1932#true} {1932#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-27 21:20:53,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {1932#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-27 21:20:53,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {1932#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {1932#true} is VALID [2022-04-27 21:20:53,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {1932#true} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-27 21:20:53,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {1932#true} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {1937#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 21:20:53,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {1937#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {1937#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 21:20:53,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1937#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {1937#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 21:20:53,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {1937#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#false} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#false} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {1933#false} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {1933#false} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {1933#false} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {1933#false} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {1933#false} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L272 TraceCheckUtils]: 18: Hoare triple {1933#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {1933#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1933#false} is VALID [2022-04-27 21:20:53,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {1933#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1933#false} is VALID [2022-04-27 21:20:53,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {1933#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1933#false} is VALID [2022-04-27 21:20:53,058 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 21:20:53,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:53,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960124673] [2022-04-27 21:20:53,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960124673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:53,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:53,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:20:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502515775] [2022-04-27 21:20:53,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2022-04-27 21:20:53,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:53,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:53,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:20:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:53,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:20:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:20:53,081 INFO L87 Difference]: Start difference. First operand 272 states and 510 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:53,251 INFO L93 Difference]: Finished difference Result 386 states and 723 transitions. [2022-04-27 21:20:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:20:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2022-04-27 21:20:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-27 21:20:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-27 21:20:53,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-27 21:20:53,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:53,355 INFO L225 Difference]: With dead ends: 386 [2022-04-27 21:20:53,355 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 21:20:53,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:20:53,365 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:53,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:20:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 21:20:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 56. [2022-04-27 21:20:53,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:53,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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 21:20:53,390 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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 21:20:53,390 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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 21:20:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:53,393 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-27 21:20:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-27 21:20:53,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:53,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:53,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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 120 states. [2022-04-27 21:20:53,394 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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 120 states. [2022-04-27 21:20:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:53,399 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-27 21:20:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-27 21:20:53,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:53,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:53,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:53,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 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 21:20:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-27 21:20:53,402 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2022-04-27 21:20:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:53,402 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-27 21:20:53,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-27 21:20:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:20:53,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:53,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:53,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:20:53,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 649784287, now seen corresponding path program 1 times [2022-04-27 21:20:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:53,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548612050] [2022-04-27 21:20:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2690#true} is VALID [2022-04-27 21:20:53,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2690#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-27 21:20:53,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2690#true} {2690#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-27 21:20:53,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {2690#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:53,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {2696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2690#true} is VALID [2022-04-27 21:20:53,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2690#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-27 21:20:53,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2690#true} {2690#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-27 21:20:53,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {2690#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-27 21:20:53,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2690#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2690#true} is VALID [2022-04-27 21:20:53,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {2690#true} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-27 21:20:53,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {2690#true} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 21:20:53,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {2695#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {2691#false} is VALID [2022-04-27 21:20:53,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {2691#false} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2691#false} is VALID [2022-04-27 21:20:53,467 INFO L272 TraceCheckUtils]: 18: Hoare triple {2691#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2691#false} is VALID [2022-04-27 21:20:53,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {2691#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2691#false} is VALID [2022-04-27 21:20:53,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {2691#false} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2691#false} is VALID [2022-04-27 21:20:53,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {2691#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2691#false} is VALID [2022-04-27 21:20:53,468 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 21:20:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548612050] [2022-04-27 21:20:53,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548612050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:53,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:53,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:20:53,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687778958] [2022-04-27 21:20:53,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2022-04-27 21:20:53,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:53,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:53,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:20:53,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:20:53,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:20:53,488 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:53,608 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-04-27 21:20:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:20:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2022-04-27 21:20:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-27 21:20:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-27 21:20:53,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-27 21:20:53,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:53,671 INFO L225 Difference]: With dead ends: 83 [2022-04-27 21:20:53,671 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 21:20:53,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:20:53,672 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:53,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 21:20:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-27 21:20:53,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:53,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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 21:20:53,690 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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 21:20:53,690 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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 21:20:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:53,692 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 21:20:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 21:20:53,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:53,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:53,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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 57 states. [2022-04-27 21:20:53,693 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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 57 states. [2022-04-27 21:20:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:53,694 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 21:20:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 21:20:53,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:53,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:53,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:53,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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 21:20:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-04-27 21:20:53,696 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 22 [2022-04-27 21:20:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:53,696 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-04-27 21:20:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21:20:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-27 21:20:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:20:53,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:53,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:53,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 21:20:53,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:53,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash 678413438, now seen corresponding path program 1 times [2022-04-27 21:20:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:53,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625968707] [2022-04-27 21:20:53,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {2991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2982#true} is VALID [2022-04-27 21:20:53,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {2982#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:53,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2982#true} {2982#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:53,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {2982#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:53,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2982#true} is VALID [2022-04-27 21:20:53,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {2982#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:53,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2982#true} {2982#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:53,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:53,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {2982#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2987#(= main_~x~0 0)} is VALID [2022-04-27 21:20:53,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {2987#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2987#(= main_~x~0 0)} is VALID [2022-04-27 21:20:53,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {2987#(= main_~x~0 0)} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 21:20:53,929 INFO L272 TraceCheckUtils]: 18: Hoare triple {2988#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2989#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:20:53,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2990#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:20:53,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {2990#(not (= __VERIFIER_assert_~cond 0))} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2983#false} is VALID [2022-04-27 21:20:53,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {2983#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2983#false} is VALID [2022-04-27 21:20:53,930 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 21:20:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625968707] [2022-04-27 21:20:53,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625968707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:20:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314946195] [2022-04-27 21:20:53,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:53,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:53,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:53,936 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 21:20:53,937 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 21:20:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 21:20:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:53,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:20:54,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {2982#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {2982#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2982#true} is VALID [2022-04-27 21:20:54,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {2982#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2982#true} {2982#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {2982#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2987#(= main_~x~0 0)} is VALID [2022-04-27 21:20:54,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {2987#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2987#(= main_~x~0 0)} is VALID [2022-04-27 21:20:54,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {2987#(= main_~x~0 0)} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {3020#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {3020#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {3020#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3020#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {3033#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 3)))} is VALID [2022-04-27 21:20:54,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {3033#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 3)))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {3016#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {3040#(and (= (+ main_~x~0 (- 3)) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {3040#(and (= (+ main_~x~0 (- 3)) 0) (not (= (mod main_~y~0 2) 0)))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3020#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 21:20:54,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {3047#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} is VALID [2022-04-27 21:20:54,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {3047#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3047#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} is VALID [2022-04-27 21:20:54,506 INFO L272 TraceCheckUtils]: 18: Hoare triple {3047#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:20:54,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {3054#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:20:54,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {3058#(<= 1 __VERIFIER_assert_~cond)} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2983#false} is VALID [2022-04-27 21:20:54,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {2983#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2983#false} is VALID [2022-04-27 21:20:54,507 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 21:20:54,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:20:54,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {2983#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2983#false} is VALID [2022-04-27 21:20:54,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {3058#(<= 1 __VERIFIER_assert_~cond)} [115] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2983#false} is VALID [2022-04-27 21:20:54,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {3054#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:20:54,953 INFO L272 TraceCheckUtils]: 18: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:20:54,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {3108#(<= 1 (mod (+ main_~x~0 1) 2))} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3074#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 21:20:54,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {3108#(<= 1 (mod (+ main_~x~0 1) 2))} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {3108#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 21:20:54,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {2982#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {3108#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 21:20:54,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2982#true} {2982#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {2982#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {2982#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2982#true} is VALID [2022-04-27 21:20:54,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {2982#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-27 21:20:54,967 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 21:20:54,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314946195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:20:54,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:20:54,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 16 [2022-04-27 21:20:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053596503] [2022-04-27 21:20:54,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:20:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:20:54,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:54,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:55,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:20:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:20:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:20:55,022 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:55,668 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-27 21:20:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 21:20:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:20:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-27 21:20:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-27 21:20:55,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-27 21:20:55,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:55,725 INFO L225 Difference]: With dead ends: 70 [2022-04-27 21:20:55,725 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:20:55,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-27 21:20:55,726 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:55,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:20:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:20:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:20:55,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:55,727 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 21:20:55,727 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 21:20:55,727 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 21:20:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:55,727 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:20:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:55,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:55,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:55,728 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 21:20:55,728 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 21:20:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:55,728 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:20:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:55,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:55,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:55,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:55,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:55,728 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 21:20:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:20:55,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 21:20:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:55,728 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:20:55,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:55,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:55,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:20:55,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:20:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 21:20:55,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:20:56,038 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:20:56,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:20:56,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:20:56,038 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:20:56,038 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:20:56,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:20:56,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:20:56,038 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 50) the Hoare annotation is: true [2022-04-27 21:20:56,039 INFO L895 garLoopResultBuilder]: At program point L45-1(lines 17 47) the Hoare annotation is: (let ((.cse0 (= (* (div main_~y~0 2) 2) main_~y~0))) (or (= main_~x~0 0) (and (= (+ 5 main_~x~0) 0) (not .cse0)) (and .cse0 (= (mod main_~x~0 2) (mod main_~y~0 2))))) [2022-04-27 21:20:56,039 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 47) the Hoare annotation is: (let ((.cse0 (mod main_~y~0 2))) (or (and (<= 1 (mod (+ main_~x~0 1) 2)) (= (mod main_~x~0 2) .cse0)) (and (not (= .cse0 0)) (= main_~x~0 (- 5))))) [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 50) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 50) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L24-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L27-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L33-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,039 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 21:20:56,040 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-27 21:20:56,040 INFO L899 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-27 21:20:56,040 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 21:20:56,040 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-27 21:20:56,040 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-27 21:20:56,040 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-27 21:20:56,043 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 21:20:56,045 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:20:56,049 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:20:56,050 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:20:56,050 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 21:20:56,052 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 21:20:56,053 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 21:20:56,053 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:20:56,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:20:56 BasicIcfg [2022-04-27 21:20:56,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:20:56,064 INFO L158 Benchmark]: Toolchain (without parser) took 33029.34ms. Allocated memory was 202.4MB in the beginning and 278.9MB in the end (delta: 76.5MB). Free memory was 147.0MB in the beginning and 204.5MB in the end (delta: -57.5MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2022-04-27 21:20:56,065 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:20:56,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.63ms. Allocated memory was 202.4MB in the beginning and 278.9MB in the end (delta: 76.5MB). Free memory was 146.8MB in the beginning and 249.9MB in the end (delta: -103.1MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-27 21:20:56,065 INFO L158 Benchmark]: Boogie Preprocessor took 35.67ms. Allocated memory is still 278.9MB. Free memory was 249.5MB in the beginning and 248.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:20:56,065 INFO L158 Benchmark]: RCFGBuilder took 315.06ms. Allocated memory is still 278.9MB. Free memory was 248.3MB in the beginning and 235.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:20:56,065 INFO L158 Benchmark]: IcfgTransformer took 23.08ms. Allocated memory is still 278.9MB. Free memory was 235.9MB in the beginning and 234.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:20:56,066 INFO L158 Benchmark]: TraceAbstraction took 32375.04ms. Allocated memory is still 278.9MB. Free memory was 233.8MB in the beginning and 204.5MB in the end (delta: 29.3MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2022-04-27 21:20:56,067 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.13ms. Allocated memory is still 202.4MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.63ms. Allocated memory was 202.4MB in the beginning and 278.9MB in the end (delta: 76.5MB). Free memory was 146.8MB in the beginning and 249.9MB in the end (delta: -103.1MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.67ms. Allocated memory is still 278.9MB. Free memory was 249.5MB in the beginning and 248.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 315.06ms. Allocated memory is still 278.9MB. Free memory was 248.3MB in the beginning and 235.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 23.08ms. Allocated memory is still 278.9MB. Free memory was 235.9MB in the beginning and 234.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 32375.04ms. Allocated memory is still 278.9MB. Free memory was 233.8MB in the beginning and 204.5MB in the end (delta: 29.3MB). Peak memory consumption was 30.1MB. 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: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 2084 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3121 IncrementalHoareTripleChecker+Invalid, 5205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2084 mSolverCounterUnsat, 132 mSDtfsCounter, 3121 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 85 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=3, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 130 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 21 NumberOfFragments, 70 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 289 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 3 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 2/8 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: 17]: Loop Invariant Derived loop invariant: (x == 0 || (5 + x == 0 && !(y / 2 * 2 == y))) || (y / 2 * 2 == y && x % 2 == y % 2) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:20:56,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...