/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:54:39,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:54:39,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:54:39,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:54:39,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:54:39,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:54:39,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:54:39,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:54:39,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:54:39,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:54:39,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:54:39,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:54:39,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:54:39,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:54:39,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:54:39,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:54:39,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:54:39,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:54:39,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:54:39,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:54:39,674 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:54:39,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:54:39,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:54:39,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:54:39,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:54:39,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:54:39,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:54:39,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:54:39,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:54:39,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:54:39,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:54:39,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:54:39,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:54:39,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:54:39,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:54:39,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:54:39,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:54:39,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:54:39,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:54:39,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:54:39,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:54:39,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:54:39,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:54:39,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:54:39,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:54:39,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:54:39,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:54:39,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:54:39,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:54:39,726 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:54:39,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:54:39,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:54:39,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:54:39,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:54:39,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:54:39,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:54:39,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:54:39,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:54:39,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:54:39,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:54:39,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:54:39,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:54:39,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:54:39,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:54:39,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:54:39,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:54:39,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:54:39,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:54:39,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:54:39,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:54:39,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:54:39,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:54:39,732 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:54:39,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:54:39,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:54:39,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:54:39,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:54:39,972 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:54:39,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-27 21:54:40,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31eb05e3e/67b59cd175d5475ebafa19b0e6d568c0/FLAGbae0c54ce [2022-04-27 21:54:40,417 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:54:40,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-27 21:54:40,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31eb05e3e/67b59cd175d5475ebafa19b0e6d568c0/FLAGbae0c54ce [2022-04-27 21:54:40,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31eb05e3e/67b59cd175d5475ebafa19b0e6d568c0 [2022-04-27 21:54:40,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:54:40,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:54:40,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:54:40,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:54:40,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:54:40,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2efcfcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40, skipping insertion in model container [2022-04-27 21:54:40,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:54:40,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:54:40,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c[406,419] [2022-04-27 21:54:40,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:54:40,659 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:54:40,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c[406,419] [2022-04-27 21:54:40,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:54:40,684 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:54:40,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40 WrapperNode [2022-04-27 21:54:40,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:54:40,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:54:40,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:54:40,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:54:40,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:54:40,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:54:40,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:54:40,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:54:40,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (1/1) ... [2022-04-27 21:54:40,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:54:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:54:40,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:54:40,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:54:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:54:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:54:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:54:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:54:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:54:40,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:54:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:54:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:54:40,822 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:54:40,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:54:40,996 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:54:41,002 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:54:41,003 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:54:41,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:54:41 BoogieIcfgContainer [2022-04-27 21:54:41,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:54:41,005 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:54:41,005 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:54:41,015 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:54:41,018 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:54:41" (1/1) ... [2022-04-27 21:54:41,020 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:54:41,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:54:41 BasicIcfg [2022-04-27 21:54:41,071 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:54:41,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:54:41,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:54:41,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:54:41,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:54:40" (1/4) ... [2022-04-27 21:54:41,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e86c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:54:41, skipping insertion in model container [2022-04-27 21:54:41,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:40" (2/4) ... [2022-04-27 21:54:41,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e86c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:54:41, skipping insertion in model container [2022-04-27 21:54:41,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:54:41" (3/4) ... [2022-04-27 21:54:41,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e86c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:54:41, skipping insertion in model container [2022-04-27 21:54:41,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:54:41" (4/4) ... [2022-04-27 21:54:41,078 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.cqvasr [2022-04-27 21:54:41,092 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:54:41,093 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:54:41,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:54:41,164 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1081bf1b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78054365 [2022-04-27 21:54:41,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:54:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:54:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:54:41,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:41,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:41,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash -801963998, now seen corresponding path program 1 times [2022-04-27 21:54:41,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:41,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605227536] [2022-04-27 21:54:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:41,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 21:54:41,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:54:41,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:54:41,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:41,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 21:54:41,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:54:41,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:54:41,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:54:41,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [68] mainENTRY-->L20: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {25#true} is VALID [2022-04-27 21:54:41,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [71] L20-->L28: Formula: (and (= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_3 v_main_~k~0_2) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~k~0_2 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {30#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:54:41,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(and (= main_~j~0 0) (= main_~i~0 0))} [75] L28-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:54:41,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} [77] L24-->L24-2: Formula: (and (= v_main_~j~0_4 (+ v_main_~j~0_5 3)) (not (= (mod v_main_~i~0_7 2) 0))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-27 21:54:41,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} [79] L24-2-->L29: Formula: (< 0 (mod v_main_~n~0_1 4294967296)) InVars {main_~n~0=v_main_~n~0_1} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-27 21:54:41,866 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} [81] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod v_main_~i~0_9 4294967296) 2) 4294967296) (mod v_main_~j~0_6 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_9, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:54:41,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:54:41,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} [83] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:54:41,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} [85] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:54:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605227536] [2022-04-27 21:54:41,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605227536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:54:41,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:54:41,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:54:41,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110417363] [2022-04-27 21:54:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:54:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-27 21:54:41,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:41,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:41,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:54:41,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:54:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:54:41,941 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:46,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:48,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:52,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:55,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:57,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:59,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:59,349 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-27 21:54:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:54:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-27 21:54:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-27 21:54:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-27 21:54:59,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2022-04-27 21:54:59,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:59,601 INFO L225 Difference]: With dead ends: 53 [2022-04-27 21:54:59,601 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 21:54:59,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:54:59,609 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-27 21:54:59,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 12.5s Time] [2022-04-27 21:54:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 21:54:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-27 21:54:59,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:54:59,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:54:59,647 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:54:59,648 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:54:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:59,657 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 21:54:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 21:54:59,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:59,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:59,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 21:54:59,660 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 21:54:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:59,665 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 21:54:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 21:54:59,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:59,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:59,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:54:59,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:54:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:54:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 21:54:59,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-27 21:54:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:54:59,677 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 21:54:59,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 21:54:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:54:59,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:59,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:59,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:54:59,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2135486064, now seen corresponding path program 1 times [2022-04-27 21:54:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:59,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319974592] [2022-04-27 21:54:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:59,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:59,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {207#true} is VALID [2022-04-27 21:54:59,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 21:54:59,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 21:54:59,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {207#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:59,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {207#true} is VALID [2022-04-27 21:54:59,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 21:54:59,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207#true} {207#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 21:54:59,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {207#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 21:54:59,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {207#true} [68] mainENTRY-->L20: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {207#true} is VALID [2022-04-27 21:54:59,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#true} [71] L20-->L28: Formula: (and (= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_3 v_main_~k~0_2) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~k~0_2 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {207#true} is VALID [2022-04-27 21:54:59,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#true} [75] L28-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {207#true} is VALID [2022-04-27 21:54:59,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#true} [77] L24-->L24-2: Formula: (and (= v_main_~j~0_4 (+ v_main_~j~0_5 3)) (not (= (mod v_main_~i~0_7 2) 0))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {207#true} is VALID [2022-04-27 21:54:59,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#true} [80] L24-2-->L28: Formula: (not (< 0 (mod v_main_~n~0_2 4294967296))) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {212#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-27 21:54:59,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} [75] L28-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {212#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-27 21:54:59,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} [77] L24-->L24-2: Formula: (and (= v_main_~j~0_4 (+ v_main_~j~0_5 3)) (not (= (mod v_main_~i~0_7 2) 0))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {212#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-27 21:54:59,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} [79] L24-2-->L29: Formula: (< 0 (mod v_main_~n~0_1 4294967296)) InVars {main_~n~0=v_main_~n~0_1} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-27 21:54:59,774 INFO L272 TraceCheckUtils]: 13: Hoare triple {208#false} [81] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod v_main_~i~0_9 4294967296) 2) 4294967296) (mod v_main_~j~0_6 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_9, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {208#false} is VALID [2022-04-27 21:54:59,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {208#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {208#false} is VALID [2022-04-27 21:54:59,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {208#false} [83] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-27 21:54:59,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {208#false} [85] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-27 21:54:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:59,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:59,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319974592] [2022-04-27 21:54:59,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319974592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:54:59,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:54:59,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:54:59,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086490362] [2022-04-27 21:54:59,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:54:59,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2022-04-27 21:54:59,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:59,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:59,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:59,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:54:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:54:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:54:59,797 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:03,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:06,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:06,257 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 21:55:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:55:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2022-04-27 21:55:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:55:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 21:55:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 21:55:06,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-27 21:55:06,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:55:06,308 INFO L225 Difference]: With dead ends: 36 [2022-04-27 21:55:06,308 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 21:55:06,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:55:06,310 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:55:06,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-27 21:55:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 21:55:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 21:55:06,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:55:06,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:55:06,319 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:55:06,319 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:55:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:06,321 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 21:55:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-27 21:55:06,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:55:06,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:55:06,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 21:55:06,322 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 21:55:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:06,324 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 21:55:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-27 21:55:06,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:55:06,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:55:06,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:55:06,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:55:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:55:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-27 21:55:06,326 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2022-04-27 21:55:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:55:06,326 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-27 21:55:06,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-27 21:55:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:55:06,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:55:06,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:55:06,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:55:06,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:55:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:55:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1201514649, now seen corresponding path program 1 times [2022-04-27 21:55:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:55:06,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935349200] [2022-04-27 21:55:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:55:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:55:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:55:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:06,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {353#true} is VALID [2022-04-27 21:55:06,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 21:55:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:06,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {353#true} is VALID [2022-04-27 21:55:06,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#true} [84] L10-->L10-2: Formula: (not (= 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[] {353#true} is VALID [2022-04-27 21:55:06,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} [87] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} [90] __VERIFIER_assertEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod v_main_~i~0_9 4294967296) 2) 4294967296) (mod v_main_~j~0_6 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_9, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:55:06,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:55:06,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {353#true} is VALID [2022-04-27 21:55:06,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {353#true} [68] mainENTRY-->L20: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {353#true} is VALID [2022-04-27 21:55:06,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {353#true} [71] L20-->L28: Formula: (and (= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_3 v_main_~k~0_2) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~k~0_2 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {358#(= main_~i~0 0)} is VALID [2022-04-27 21:55:06,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#(= main_~i~0 0)} [75] L28-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:55:06,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} [77] L24-->L24-2: Formula: (and (= v_main_~j~0_4 (+ v_main_~j~0_5 3)) (not (= (mod v_main_~i~0_7 2) 0))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:55:06,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} [79] L24-2-->L29: Formula: (< 0 (mod v_main_~n~0_1 4294967296)) InVars {main_~n~0=v_main_~n~0_1} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:55:06,525 INFO L272 TraceCheckUtils]: 10: Hoare triple {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} [81] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod v_main_~i~0_9 4294967296) 2) 4294967296) (mod v_main_~j~0_6 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_9, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {353#true} is VALID [2022-04-27 21:55:06,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {353#true} is VALID [2022-04-27 21:55:06,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {353#true} [84] L10-->L10-2: Formula: (not (= 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[] {353#true} is VALID [2022-04-27 21:55:06,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#true} [87] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#true} is VALID [2022-04-27 21:55:06,526 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {353#true} {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} [90] __VERIFIER_assertEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod v_main_~i~0_9 4294967296) 2) 4294967296) (mod v_main_~j~0_6 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_9, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:55:06,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {359#(and (<= 3 main_~i~0) (<= main_~i~0 3))} [75] L28-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {364#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 6 main_~i~0))} is VALID [2022-04-27 21:55:06,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 6 main_~i~0))} [77] L24-->L24-2: Formula: (and (= v_main_~j~0_4 (+ v_main_~j~0_5 3)) (not (= (mod v_main_~i~0_7 2) 0))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {354#false} is VALID [2022-04-27 21:55:06,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#false} [79] L24-2-->L29: Formula: (< 0 (mod v_main_~n~0_1 4294967296)) InVars {main_~n~0=v_main_~n~0_1} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {354#false} is VALID [2022-04-27 21:55:06,528 INFO L272 TraceCheckUtils]: 18: Hoare triple {354#false} [81] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod v_main_~i~0_9 4294967296) 2) 4294967296) (mod v_main_~j~0_6 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_9, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {354#false} is VALID [2022-04-27 21:55:06,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {354#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#false} is VALID [2022-04-27 21:55:06,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {354#false} [83] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {354#false} is VALID [2022-04-27 21:55:06,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {354#false} [85] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#false} is VALID [2022-04-27 21:55:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:55:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:55:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935349200] [2022-04-27 21:55:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935349200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:55:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350243653] [2022-04-27 21:55:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:55:06,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:55:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:55:06,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:55:06,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process