/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-34549b5 [2022-04-07 22:14:21,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:14:21,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:14:21,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:14:21,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:14:21,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:14:21,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:14:21,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:14:21,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:14:21,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:14:21,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:14:21,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:14:21,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:14:21,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:14:21,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:14:21,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:14:21,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:14:21,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:14:21,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:14:21,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:14:21,546 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:14:21,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:14:21,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:14:21,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:14:21,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:14:21,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:14:21,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:14:21,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:14:21,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:14:21,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:14:21,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:14:21,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:14:21,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:14:21,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:14:21,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:14:21,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:14:21,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:14:21,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:14:21,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:14:21,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:14:21,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:14:21,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:14:21,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:14:21,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:14:21,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:14:21,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:14:21,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:14:21,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:14:21,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:14:21,596 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:14:21,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:14:21,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:14:21,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:14:21,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:14:21,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:14:21,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:14:21,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:14:21,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:14:21,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:14:21,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:14:21,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:14:21,598 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:14:21,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:14:21,598 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:14:21,599 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-07 22:14:21,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:14:21,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:14:21,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:14:21,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:14:21,810 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:14:21,811 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-07 22:14:21,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94f6a2e2/e091168c169148e1979d35d3dd7b98d8/FLAG727e6f0dd [2022-04-07 22:14:22,237 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:14:22,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-07 22:14:22,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94f6a2e2/e091168c169148e1979d35d3dd7b98d8/FLAG727e6f0dd [2022-04-07 22:14:22,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94f6a2e2/e091168c169148e1979d35d3dd7b98d8 [2022-04-07 22:14:22,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:14:22,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:14:22,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:14:22,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:14:22,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:14:22,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a8af69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22, skipping insertion in model container [2022-04-07 22:14:22,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:14:22,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:14:22,374 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-07 22:14:22,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:14:22,423 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:14:22,431 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-07 22:14:22,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:14:22,447 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:14:22,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22 WrapperNode [2022-04-07 22:14:22,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:14:22,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:14:22,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:14:22,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:14:22,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:14:22,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:14:22,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:14:22,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:14:22,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:14:22,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:14:22,499 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-07 22:14:22,501 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-07 22:14:22,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:14:22,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:14:22,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:14:22,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:14:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:14:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:14:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:14:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:14:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:14:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 22:14:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:14:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:14:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:14:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:14:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:14:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:14:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:14:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:14:22,575 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:14:22,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:14:22,703 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:14:22,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:14:22,708 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 22:14:22,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:14:22 BoogieIcfgContainer [2022-04-07 22:14:22,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:14:22,710 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:14:22,710 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:14:22,711 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:14:22,713 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:14:22" (1/1) ... [2022-04-07 22:14:22,715 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:14:22,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:14:22 BasicIcfg [2022-04-07 22:14:22,732 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:14:22,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:14:22,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:14:22,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:14:22,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:14:22" (1/4) ... [2022-04-07 22:14:22,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3858a630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:14:22, skipping insertion in model container [2022-04-07 22:14:22,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:22" (2/4) ... [2022-04-07 22:14:22,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3858a630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:14:22, skipping insertion in model container [2022-04-07 22:14:22,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:14:22" (3/4) ... [2022-04-07 22:14:22,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3858a630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:14:22, skipping insertion in model container [2022-04-07 22:14:22,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:14:22" (4/4) ... [2022-04-07 22:14:22,737 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.cqvasr [2022-04-07 22:14:22,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:14:22,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:14:22,771 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:14:22,775 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:14:22,776 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:14:22,793 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-07 22:14:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:14:22,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:22,797 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:22,797 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -935980469, now seen corresponding path program 1 times [2022-04-07 22:14:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:22,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570597674] [2022-04-07 22:14:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:22,980 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-07 22:14:22,980 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-07 22:14:22,980 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-07 22:14:22,982 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-07 22:14:22,982 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-07 22:14:22,983 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-07 22:14:22,983 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-07 22:14:22,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-07 22:14:22,983 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-07 22:14:22,984 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-07 22:14:22,984 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-07 22:14:22,984 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-07 22:14:22,985 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-07 22:14:22,985 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-07 22:14:22,985 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-07 22:14:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570597674] [2022-04-07 22:14:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570597674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:14:22,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:14:22,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:14:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153304700] [2022-04-07 22:14:22,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:14:22,992 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-07 22:14:22,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:22,998 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-07 22:14:23,024 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-07 22:14:23,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:14:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:14:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:14:23,055 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-07 22:14:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:23,156 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-07 22:14:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:14:23,156 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-07 22:14:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:23,157 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-07 22:14:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-07 22:14:23,168 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-07 22:14:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-07 22:14:23,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-07 22:14:23,239 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-07 22:14:23,248 INFO L225 Difference]: With dead ends: 39 [2022-04-07 22:14:23,248 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 22:14:23,250 INFO L912 BasicCegarLoop]: 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-07 22:14:23,255 INFO L913 BasicCegarLoop]: 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-07 22:14:23,256 INFO L914 BasicCegarLoop]: 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-07 22:14:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 22:14:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 22:14:23,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:23,281 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-07 22:14:23,281 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-07 22:14:23,282 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-07 22:14:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:23,284 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-07 22:14:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-07 22:14:23,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:23,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:23,285 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-07 22:14:23,285 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-07 22:14:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:23,290 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-07 22:14:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-07 22:14:23,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:23,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:23,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:23,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:23,291 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-07 22:14:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-07 22:14:23,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-07 22:14:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:23,293 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-07 22:14:23,294 INFO L479 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-07 22:14:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-07 22:14:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:14:23,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:23,294 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:23,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:14:23,295 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:23,295 INFO L85 PathProgramCache]: Analyzing trace with hash -935056948, now seen corresponding path program 1 times [2022-04-07 22:14:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:23,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142999291] [2022-04-07 22:14:23,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:23,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:23,366 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-07 22:14:23,366 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-07 22:14:23,367 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-07 22:14:23,367 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-07 22:14:23,367 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-07 22:14:23,368 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-07 22:14:23,368 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-07 22:14:23,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#true} is VALID [2022-04-07 22:14:23,368 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-07 22:14:23,369 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-07 22:14:23,369 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-07 22:14:23,369 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-07 22:14:23,369 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-07 22:14:23,370 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-07 22:14:23,370 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-07 22:14:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:23,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142999291] [2022-04-07 22:14:23,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142999291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:14:23,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:14:23,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:14:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097172695] [2022-04-07 22:14:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:14:23,371 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-07 22:14:23,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:23,372 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-07 22:14:23,381 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-07 22:14:23,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:14:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:23,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:14:23,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:14:23,383 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-07 22:14:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:23,487 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-07 22:14:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:14:23,487 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-07 22:14:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:23,488 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-07 22:14:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-07 22:14:23,493 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-07 22:14:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-07 22:14:23,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-07 22:14:23,526 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-07 22:14:23,529 INFO L225 Difference]: With dead ends: 29 [2022-04-07 22:14:23,529 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 22:14:23,532 INFO L912 BasicCegarLoop]: 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-07 22:14:23,533 INFO L913 BasicCegarLoop]: 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-07 22:14:23,534 INFO L914 BasicCegarLoop]: 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-07 22:14:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 22:14:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-07 22:14:23,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:23,539 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-07 22:14:23,539 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-07 22:14:23,540 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-07 22:14:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:23,542 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-07 22:14:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-07 22:14:23,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:23,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:23,543 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-07 22:14:23,543 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-07 22:14:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:23,545 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-07 22:14:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-07 22:14:23,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:23,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:23,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:23,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:23,545 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-07 22:14:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-07 22:14:23,546 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-07 22:14:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:23,546 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-07 22:14:23,547 INFO L479 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-07 22:14:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-07 22:14:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 22:14:23,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:23,547 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:23,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:14:23,548 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 982716702, now seen corresponding path program 1 times [2022-04-07 22:14:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:23,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728963391] [2022-04-07 22:14:23,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:23,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:23,921 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-07 22:14:23,921 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-07 22:14:23,922 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-07 22:14:23,923 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-07 22:14:23,923 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-07 22:14:23,923 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-07 22:14:23,923 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-07 22:14:23,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-07 22:14:23,924 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-07 22:14:23,924 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-07 22:14:23,924 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-07 22:14:23,925 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-07 22:14:23,926 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-07 22:14:23,928 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-07 22:14:23,928 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-07 22:14:23,929 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-07 22:14:23,930 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-07 22:14:23,930 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-07 22:14:23,931 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-07 22:14:23,932 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-07 22:14:23,932 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-07 22:14:23,932 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-07 22:14:23,933 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-07 22:14:23,933 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-07 22:14:23,933 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-07 22:14:23,933 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-07 22:14:23,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:23,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728963391] [2022-04-07 22:14:23,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728963391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:14:23,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724445934] [2022-04-07 22:14:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:14:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:14:23,935 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-07 22:14:23,941 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-07 22:14:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:23,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 22:14:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:23,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:14:24,359 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-07 22:14:24,360 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-07 22:14:24,362 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-07 22:14:24,362 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-07 22:14:24,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-07 22:14:24,363 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-07 22:14:24,363 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-07 22:14:24,364 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-07 22:14:24,364 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-07 22:14:24,365 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-07 22:14:24,365 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-07 22:14:24,366 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-07 22:14:24,367 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-07 22:14:24,367 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-07 22:14:24,368 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-07 22:14:24,368 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-07 22:14:24,369 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-07 22:14:24,370 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-07 22:14:24,370 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-07 22:14:24,370 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-07 22:14:24,370 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-07 22:14:24,371 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-07 22:14:24,371 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-07 22:14:24,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:14:24,736 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-07 22:14:24,736 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-07 22:14:24,737 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-07 22:14:24,737 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-07 22:14:24,738 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-07 22:14:24,738 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-07 22:14:24,739 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-07 22:14:24,740 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-07 22:14:24,741 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-07 22:14:24,742 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-07 22:14:24,742 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-07 22:14:24,743 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-07 22:14:24,744 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-07 22:14:24,744 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-07 22:14:24,745 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-07 22:14:24,745 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-07 22:14:24,746 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-07 22:14:24,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289#true} is VALID [2022-04-07 22:14:24,746 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-07 22:14:24,746 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-07 22:14:24,746 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-07 22:14:24,747 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-07 22:14:24,747 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-07 22:14:24,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724445934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:14:24,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:14:24,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-07 22:14:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129263754] [2022-04-07 22:14:24,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:14:24,751 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-07 22:14:24,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:24,751 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-07 22:14:24,785 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-07 22:14:24,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 22:14:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:24,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 22:14:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-07 22:14:24,786 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-07 22:14:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:48,125 INFO L93 Difference]: Finished difference Result 341 states and 660 transitions. [2022-04-07 22:14:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-07 22:14:48,125 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-07 22:14:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:48,126 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-07 22:14:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 659 transitions. [2022-04-07 22:14:48,135 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-07 22:14:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 659 transitions. [2022-04-07 22:14:48,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 659 transitions. [2022-04-07 22:14:49,762 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-07 22:14:49,772 INFO L225 Difference]: With dead ends: 341 [2022-04-07 22:14:49,772 INFO L226 Difference]: Without dead ends: 336 [2022-04-07 22:14:49,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1529, Invalid=4021, Unknown=0, NotChecked=0, Total=5550 [2022-04-07 22:14:49,774 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 234 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 1997 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 4778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1997 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-07 22:14:49,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 67 Invalid, 4778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1997 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-07 22:14:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-07 22:14:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 272. [2022-04-07 22:14:49,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:49,823 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-07 22:14:49,824 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-07 22:14:49,825 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-07 22:14:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:49,836 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-07 22:14:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 634 transitions. [2022-04-07 22:14:49,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:49,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:49,838 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-07 22:14:49,839 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-07 22:14:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:49,850 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-07 22:14:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 634 transitions. [2022-04-07 22:14:49,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:49,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:49,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:49,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:49,852 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-07 22:14:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 510 transitions. [2022-04-07 22:14:49,881 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 510 transitions. Word has length 22 [2022-04-07 22:14:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:49,882 INFO L478 AbstractCegarLoop]: Abstraction has 272 states and 510 transitions. [2022-04-07 22:14:49,882 INFO L479 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-07 22:14:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 510 transitions. [2022-04-07 22:14:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 22:14:49,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:49,883 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:49,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 22:14:50,083 WARN L460 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-07 22:14:50,084 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1831418748, now seen corresponding path program 1 times [2022-04-07 22:14:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:50,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914778029] [2022-04-07 22:14:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,123 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-07 22:14:50,123 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-07 22:14:50,123 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-07 22:14:50,124 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-07 22:14:50,124 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-07 22:14:50,124 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-07 22:14:50,124 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-07 22:14:50,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1932#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1932#true} is VALID [2022-04-07 22:14:50,124 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-07 22:14:50,125 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-07 22:14:50,125 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-07 22:14:50,125 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-07 22:14:50,126 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-07 22:14:50,126 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-07 22:14:50,126 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,127 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-07 22:14:50,128 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-07 22:14:50,128 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-07 22:14:50,128 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-07 22:14:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914778029] [2022-04-07 22:14:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914778029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:14:50,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:14:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:14:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689595209] [2022-04-07 22:14:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:14:50,129 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-07 22:14:50,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:50,129 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-07 22:14:50,147 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-07 22:14:50,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:14:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:50,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:14:50,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:14:50,148 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-07 22:14:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:50,280 INFO L93 Difference]: Finished difference Result 386 states and 723 transitions. [2022-04-07 22:14:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:14:50,281 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-07 22:14:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:50,281 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-07 22:14:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-07 22:14:50,285 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-07 22:14:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-07 22:14:50,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-07 22:14:50,338 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-07 22:14:50,341 INFO L225 Difference]: With dead ends: 386 [2022-04-07 22:14:50,341 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 22:14:50,345 INFO L912 BasicCegarLoop]: 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-07 22:14:50,349 INFO L913 BasicCegarLoop]: 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:14:50,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:14:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 22:14:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 56. [2022-04-07 22:14:50,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:50,374 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-07 22:14:50,374 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-07 22:14:50,374 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-07 22:14:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:50,377 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-07 22:14:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-07 22:14:50,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:50,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:50,378 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-07 22:14:50,378 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-07 22:14:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:50,382 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-07 22:14:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-07 22:14:50,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:50,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:50,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:50,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:50,383 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-07 22:14:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-07 22:14:50,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2022-04-07 22:14:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:50,384 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-07 22:14:50,384 INFO L479 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-07 22:14:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-07 22:14:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 22:14:50,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:50,385 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:50,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 22:14:50,385 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash 649784287, now seen corresponding path program 1 times [2022-04-07 22:14:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:50,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157146075] [2022-04-07 22:14:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,442 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-07 22:14:50,442 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-07 22:14:50,443 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-07 22:14:50,443 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-07 22:14:50,443 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-07 22:14:50,443 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-07 22:14:50,443 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-07 22:14:50,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {2690#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2690#true} is VALID [2022-04-07 22:14:50,444 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-07 22:14:50,444 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-07 22:14:50,444 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-07 22:14:50,445 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-07 22:14:50,445 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-07 22:14:50,445 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-07 22:14:50,445 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-07 22:14:50,446 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-07 22:14:50,446 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-07 22:14:50,446 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-07 22:14:50,447 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-07 22:14:50,447 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-07 22:14:50,447 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-07 22:14:50,447 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-07 22:14:50,447 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-07 22:14:50,449 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-07 22:14:50,449 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-07 22:14:50,453 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-07 22:14:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:50,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157146075] [2022-04-07 22:14:50,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157146075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:14:50,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:14:50,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:14:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879239166] [2022-04-07 22:14:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:14:50,454 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-07 22:14:50,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:50,454 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-07 22:14:50,468 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-07 22:14:50,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:14:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:50,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:14:50,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:14:50,469 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-07 22:14:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:50,587 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-04-07 22:14:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:14:50,587 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-07 22:14:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:50,587 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-07 22:14:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-07 22:14:50,588 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-07 22:14:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-07 22:14:50,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-07 22:14:50,634 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-07 22:14:50,634 INFO L225 Difference]: With dead ends: 83 [2022-04-07 22:14:50,634 INFO L226 Difference]: Without dead ends: 57 [2022-04-07 22:14:50,635 INFO L912 BasicCegarLoop]: 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-07 22:14:50,635 INFO L913 BasicCegarLoop]: 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-07 22:14:50,635 INFO L914 BasicCegarLoop]: 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-07 22:14:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-07 22:14:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-07 22:14:50,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:50,649 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-07 22:14:50,649 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-07 22:14:50,649 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-07 22:14:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:50,650 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-07 22:14:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-07 22:14:50,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:50,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:50,651 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-07 22:14:50,651 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-07 22:14:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:50,652 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-07 22:14:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-07 22:14:50,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:50,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:50,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:50,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:50,652 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-07 22:14:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-04-07 22:14:50,653 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 22 [2022-04-07 22:14:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:50,653 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-04-07 22:14:50,654 INFO L479 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-07 22:14:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-07 22:14:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 22:14:50,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:50,654 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:50,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 22:14:50,654 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash 678413438, now seen corresponding path program 1 times [2022-04-07 22:14:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:50,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141031750] [2022-04-07 22:14:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,819 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-07 22:14:50,819 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-07 22:14:50,819 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-07 22:14:50,820 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-07 22:14:50,820 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-07 22:14:50,820 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-07 22:14:50,820 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-07 22:14:50,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-07 22:14:50,820 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-07 22:14:50,821 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-07 22:14:50,821 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-07 22:14:50,822 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-07 22:14:50,823 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-07 22:14:50,824 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-07 22:14:50,825 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-07 22:14:50,826 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-07 22:14:50,827 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-07 22:14:50,827 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-07 22:14:50,828 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-07 22:14:50,829 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-07 22:14:50,829 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-07 22:14:50,830 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-07 22:14:50,831 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-07 22:14:50,831 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-07 22:14:50,831 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-07 22:14:50,832 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-07 22:14:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141031750] [2022-04-07 22:14:50,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141031750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:14:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116792663] [2022-04-07 22:14:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:50,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:14:50,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:14:50,833 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-07 22:14:50,834 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-07 22:14:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-07 22:14:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:50,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:14:51,250 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-07 22:14:51,250 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-07 22:14:51,250 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-07 22:14:51,251 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-07 22:14:51,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-07 22:14:51,251 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-07 22:14:51,252 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-07 22:14:51,253 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-07 22:14:51,253 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-07 22:14:51,254 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-07 22:14:51,254 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-07 22:14:51,254 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-07 22:14:51,255 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-07 22:14:51,255 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-07 22:14:51,256 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-07 22:14:51,256 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-07 22:14:51,257 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-07 22:14:51,257 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-07 22:14:51,258 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-07 22:14:51,258 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-07 22:14:51,258 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-07 22:14:51,259 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-07 22:14:51,259 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-07 22:14:51,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:14:51,652 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-07 22:14:51,652 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-07 22:14:51,652 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-07 22:14:51,653 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-07 22:14:51,653 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-07 22:14:51,654 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-07 22:14:51,655 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-07 22:14:51,658 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-07 22:14:51,662 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-07 22:14:51,663 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-07 22:14:51,663 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-07 22:14:51,664 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-07 22:14:51,665 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-07 22:14:51,665 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-07 22:14:51,666 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-07 22:14:51,666 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-07 22:14:51,666 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-07 22:14:51,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {2982#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2982#true} is VALID [2022-04-07 22:14:51,667 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-07 22:14:51,667 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-07 22:14:51,667 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-07 22:14:51,667 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-07 22:14:51,667 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-07 22:14:51,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116792663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:14:51,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:14:51,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 16 [2022-04-07 22:14:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625059254] [2022-04-07 22:14:51,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:14:51,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-07 22:14:51,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:51,668 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-07 22:14:51,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-07 22:14:51,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 22:14:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 22:14:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 22:14:51,726 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-07 22:14:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:52,283 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-07 22:14:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 22:14:52,284 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-07 22:14:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:52,284 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-07 22:14:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-07 22:14:52,285 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-07 22:14:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-07 22:14:52,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-07 22:14:52,327 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-07 22:14:52,328 INFO L225 Difference]: With dead ends: 70 [2022-04-07 22:14:52,328 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:14:52,328 INFO L912 BasicCegarLoop]: 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-07 22:14:52,329 INFO L913 BasicCegarLoop]: 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-07 22:14:52,329 INFO L914 BasicCegarLoop]: 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-07 22:14:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:14:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:14:52,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:52,329 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-07 22:14:52,329 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-07 22:14:52,329 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-07 22:14:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:52,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:14:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:14:52,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:52,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:52,330 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-07 22:14:52,330 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-07 22:14:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:52,330 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:14:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:14:52,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:52,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:52,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:52,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:52,330 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-07 22:14:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:14:52,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-07 22:14:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:52,330 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:14:52,330 INFO L479 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-07 22:14:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:14:52,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:52,333 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:14:52,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 22:14:52,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-07 22:14:52,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:14:52,615 INFO L878 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-07 22:14:52,615 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:14:52,615 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:14:52,615 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:14:52,615 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:14:52,615 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:14:52,615 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 50) the Hoare annotation is: true [2022-04-07 22:14:52,616 INFO L878 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-07 22:14:52,616 INFO L878 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-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 50) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 50) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L21-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L24-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L27-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L30-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L33-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L36-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L39-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L42-1(lines 17 47) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-07 22:14:52,616 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-07 22:14:52,617 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-07 22:14:52,617 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-07 22:14:52,619 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-07 22:14:52,620 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:14:52,622 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:14:52,623 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:14:52,623 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-07 22:14:52,625 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-07 22:14:52,626 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-07 22:14:52,626 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-07 22:14:52,626 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-07 22:14:52,626 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-07 22:14:52,626 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-07 22:14:52,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:14:52 BasicIcfg [2022-04-07 22:14:52,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:14:52,634 INFO L158 Benchmark]: Toolchain (without parser) took 30380.80ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 128.0MB in the beginning and 137.5MB in the end (delta: -9.6MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2022-04-07 22:14:52,634 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:14:52,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.95ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 127.7MB in the beginning and 194.7MB in the end (delta: -67.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-07 22:14:52,634 INFO L158 Benchmark]: Boogie Preprocessor took 23.93ms. Allocated memory is still 219.2MB. Free memory was 194.7MB in the beginning and 193.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:14:52,635 INFO L158 Benchmark]: RCFGBuilder took 236.75ms. Allocated memory is still 219.2MB. Free memory was 193.1MB in the beginning and 180.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 22:14:52,635 INFO L158 Benchmark]: IcfgTransformer took 21.48ms. Allocated memory is still 219.2MB. Free memory was 180.5MB in the beginning and 179.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:14:52,635 INFO L158 Benchmark]: TraceAbstraction took 29900.24ms. Allocated memory is still 219.2MB. Free memory was 178.4MB in the beginning and 137.5MB in the end (delta: 40.9MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2022-04-07 22:14:52,636 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.12ms. Allocated memory is still 182.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.95ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 127.7MB in the beginning and 194.7MB in the end (delta: -67.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.93ms. Allocated memory is still 219.2MB. Free memory was 194.7MB in the beginning and 193.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 236.75ms. Allocated memory is still 219.2MB. Free memory was 193.1MB in the beginning and 180.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 21.48ms. Allocated memory is still 219.2MB. Free memory was 180.5MB in the beginning and 179.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 29900.24ms. Allocated memory is still 219.2MB. Free memory was 178.4MB in the beginning and 137.5MB in the end (delta: 40.9MB). Peak memory consumption was 41.4MB. 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: 29.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 6.3s 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.2s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s 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-07 22:14:52,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...