/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/nla-digbench-scaling/mannadiv_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 04:14:02,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 04:14:02,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 04:14:02,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 04:14:02,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 04:14:02,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 04:14:02,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 04:14:02,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 04:14:02,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 04:14:02,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 04:14:02,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 04:14:02,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 04:14:02,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 04:14:02,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 04:14:02,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 04:14:02,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 04:14:02,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 04:14:02,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 04:14:02,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 04:14:02,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 04:14:02,566 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 04:14:02,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 04:14:02,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 04:14:02,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 04:14:02,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 04:14:02,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 04:14:02,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 04:14:02,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 04:14:02,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 04:14:02,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 04:14:02,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 04:14:02,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 04:14:02,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 04:14:02,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 04:14:02,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 04:14:02,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 04:14:02,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 04:14:02,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 04:14:02,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 04:14:02,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 04:14:02,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 04:14:02,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 04:14:02,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 04:14:02,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 04:14:02,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 04:14:02,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 04:14:02,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 04:14:02,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 04:14:02,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 04:14:02,614 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 04:14:02,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 04:14:02,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 04:14:02,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 04:14:02,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 04:14:02,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 04:14:02,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:14:02,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 04:14:02,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 04:14:02,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 04:14:02,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 04:14:02,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 04:14:02,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 04:14:02,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 04:14:02,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 04:14:02,619 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 04:14:02,619 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-15 04:14:02,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 04:14:02,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 04:14:02,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 04:14:02,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 04:14:02,894 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 04:14:02,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound2.c [2022-04-15 04:14:02,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce49b24b/770d214be4b743509bab6754cdc983b3/FLAGa0c67087b [2022-04-15 04:14:03,372 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 04:14:03,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound2.c [2022-04-15 04:14:03,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce49b24b/770d214be4b743509bab6754cdc983b3/FLAGa0c67087b [2022-04-15 04:14:03,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce49b24b/770d214be4b743509bab6754cdc983b3 [2022-04-15 04:14:03,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 04:14:03,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 04:14:03,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 04:14:03,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 04:14:03,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 04:14:03,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a90a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03, skipping insertion in model container [2022-04-15 04:14:03,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 04:14:03,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 04:14:03,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound2.c[573,586] [2022-04-15 04:14:03,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:14:03,692 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 04:14:03,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound2.c[573,586] [2022-04-15 04:14:03,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:14:03,732 INFO L208 MainTranslator]: Completed translation [2022-04-15 04:14:03,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03 WrapperNode [2022-04-15 04:14:03,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 04:14:03,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 04:14:03,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 04:14:03,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 04:14:03,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 04:14:03,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 04:14:03,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 04:14:03,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 04:14:03,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (1/1) ... [2022-04-15 04:14:03,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:14:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:14:03,812 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-15 04:14:03,840 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-15 04:14:03,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 04:14:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 04:14:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 04:14:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 04:14:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 04:14:03,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 04:14:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 04:14:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 04:14:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 04:14:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 04:14:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 04:14:03,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 04:14:03,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 04:14:03,922 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 04:14:03,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 04:14:04,100 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 04:14:04,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 04:14:04,106 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 04:14:04,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:14:04 BoogieIcfgContainer [2022-04-15 04:14:04,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 04:14:04,109 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 04:14:04,109 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 04:14:04,110 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 04:14:04,112 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:14:04" (1/1) ... [2022-04-15 04:14:04,114 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 04:14:04,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:14:04 BasicIcfg [2022-04-15 04:14:04,147 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 04:14:04,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 04:14:04,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 04:14:04,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 04:14:04,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:14:03" (1/4) ... [2022-04-15 04:14:04,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a806b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:14:04, skipping insertion in model container [2022-04-15 04:14:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:14:03" (2/4) ... [2022-04-15 04:14:04,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a806b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:14:04, skipping insertion in model container [2022-04-15 04:14:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:14:04" (3/4) ... [2022-04-15 04:14:04,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a806b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:14:04, skipping insertion in model container [2022-04-15 04:14:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:14:04" (4/4) ... [2022-04-15 04:14:04,153 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound2.cqvasr [2022-04-15 04:14:04,174 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 04:14:04,174 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 04:14:04,228 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 04:14:04,238 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-15 04:14:04,238 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 04:14:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:14:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 04:14:04,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:14:04,262 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:14:04,263 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:14:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:14:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-15 04:14:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:14:04,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125912456] [2022-04-15 04:14:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:14:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 04:14:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:04,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-15 04:14:04,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 04:14:04,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 04:14:04,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 04:14:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:04,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-15 04:14:04,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 04:14:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 04:14:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:04,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-15 04:14:04,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 04:14:04,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 04:14:04,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-15 04:14:04,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 04:14:04,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 04:14:04,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 04:14:04,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {33#true} is VALID [2022-04-15 04:14:04,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-15 04:14:04,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-15 04:14:04,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 04:14:04,506 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-15 04:14:04,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-15 04:14:04,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,507 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 04:14:04,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {34#false} is VALID [2022-04-15 04:14:04,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [82] L41-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,508 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {34#false} is VALID [2022-04-15 04:14:04,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} [89] __VERIFIER_assertENTRY-->L16: 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#false} is VALID [2022-04-15 04:14:04,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [92] L16-->L17: 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[] {34#false} is VALID [2022-04-15 04:14:04,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 04:14:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 04:14:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:14:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125912456] [2022-04-15 04:14:04,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125912456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:14:04,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:14:04,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 04:14:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830394515] [2022-04-15 04:14:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:14:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 04:14:04,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:14:04,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:04,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:04,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 04:14:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:14:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 04:14:04,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 04:14:04,568 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:04,685 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-15 04:14:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 04:14:04,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 04:14:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:14:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-15 04:14:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-15 04:14:04,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-15 04:14:04,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:04,778 INFO L225 Difference]: With dead ends: 54 [2022-04-15 04:14:04,778 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 04:14:04,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-15 04:14:04,784 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:14:04,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:14:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 04:14:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 04:14:04,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:14:04,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:04,821 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:04,822 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:04,826 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 04:14:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 04:14:04,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:04,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:04,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 04:14:04,827 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 04:14:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:04,831 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 04:14:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 04:14:04,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:04,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:04,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:14:04,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:14:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 04:14:04,836 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-15 04:14:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:14:04,836 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 04:14:04,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 04:14:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 04:14:04,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:14:04,837 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:14:04,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 04:14:04,838 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:14:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:14:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-15 04:14:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:14:04,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505982978] [2022-04-15 04:14:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:14:04,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:14:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034357482] [2022-04-15 04:14:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:04,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:14:04,862 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-15 04:14:04,866 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-15 04:14:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:04,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 04:14:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:04,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:14:05,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-15 04:14:05,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#(<= ~counter~0 0)} {209#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(<= ~counter~0 0)} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,142 INFO L272 TraceCheckUtils]: 11: Hoare triple {217#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {217#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= ~counter~0 0)} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {217#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:05,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {266#(<= |main_#t~post6| 0)} is VALID [2022-04-15 04:14:05,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= |main_#t~post6| 0)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {210#false} is VALID [2022-04-15 04:14:05,146 INFO L272 TraceCheckUtils]: 19: Hoare triple {210#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {210#false} is VALID [2022-04-15 04:14:05,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} [89] __VERIFIER_assertENTRY-->L16: 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] {210#false} is VALID [2022-04-15 04:14:05,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} [92] L16-->L17: 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[] {210#false} is VALID [2022-04-15 04:14:05,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-15 04:14:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 04:14:05,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 04:14:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:14:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505982978] [2022-04-15 04:14:05,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:14:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034357482] [2022-04-15 04:14:05,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034357482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:14:05,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:14:05,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 04:14:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219294883] [2022-04-15 04:14:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:14:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 04:14:05,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:14:05,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:05,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:05,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 04:14:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:14:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 04:14:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 04:14:05,193 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:05,310 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 04:14:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 04:14:05,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 04:14:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:14:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 04:14:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 04:14:05,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 04:14:05,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:05,371 INFO L225 Difference]: With dead ends: 34 [2022-04-15 04:14:05,371 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 04:14:05,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 04:14:05,374 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:14:05,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:14:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 04:14:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 04:14:05,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:14:05,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:05,391 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:05,392 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:05,400 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 04:14:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 04:14:05,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:05,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:05,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 04:14:05,402 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 04:14:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:05,404 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 04:14:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 04:14:05,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:05,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:05,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:14:05,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:14:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 04:14:05,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-15 04:14:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:14:05,408 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 04:14:05,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:14:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 04:14:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 04:14:05,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:14:05,409 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:14:05,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 04:14:05,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:05,610 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:14:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:14:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-15 04:14:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:14:05,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395592088] [2022-04-15 04:14:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:14:05,630 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:14:05,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882498955] [2022-04-15 04:14:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:05,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:14:05,632 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-15 04:14:05,651 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-15 04:14:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:05,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 04:14:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:05,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:14:05,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-15 04:14:05,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {422#true} is VALID [2022-04-15 04:14:05,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-15 04:14:05,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-15 04:14:05,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-15 04:14:05,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {422#true} is VALID [2022-04-15 04:14:05,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {422#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {422#true} is VALID [2022-04-15 04:14:05,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {422#true} is VALID [2022-04-15 04:14:05,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-15 04:14:05,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-15 04:14:05,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {422#true} {422#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {422#true} is VALID [2022-04-15 04:14:05,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {422#true} is VALID [2022-04-15 04:14:05,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 04:14:05,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:14:05,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 04:14:05,964 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {467#(not (= |assume_abort_if_not_#in~cond| 0))} {422#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {474#(not (= main_~x2~0 0))} is VALID [2022-04-15 04:14:05,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(not (= main_~x2~0 0))} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-15 04:14:05,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-15 04:14:05,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-15 04:14:05,974 INFO L272 TraceCheckUtils]: 19: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:14:05,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: 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] {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:14:05,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: 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[] {423#false} is VALID [2022-04-15 04:14:05,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {423#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-15 04:14:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 04:14:05,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 04:14:05,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:14:05,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395592088] [2022-04-15 04:14:05,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:14:05,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882498955] [2022-04-15 04:14:05,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882498955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:14:05,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:14:05,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 04:14:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874294436] [2022-04-15 04:14:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:14:05,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 04:14:05,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:14:05,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 04:14:05,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:05,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 04:14:05,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:14:05,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 04:14:05,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 04:14:05,998 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 04:14:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:06,240 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 04:14:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 04:14:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 04:14:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:14:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 04:14:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 04:14:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 04:14:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 04:14:06,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 04:14:06,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:06,303 INFO L225 Difference]: With dead ends: 37 [2022-04-15 04:14:06,303 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 04:14:06,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 04:14:06,306 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:14:06,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:14:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 04:14:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-15 04:14:06,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:14:06,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:06,324 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:06,325 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:06,332 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 04:14:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 04:14:06,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:06,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:06,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 04:14:06,333 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 04:14:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:06,335 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 04:14:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 04:14:06,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:06,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:06,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:14:06,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:14:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 04:14:06,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-15 04:14:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:14:06,339 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 04:14:06,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 04:14:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 04:14:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 04:14:06,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:14:06,340 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:14:06,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 04:14:06,563 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,SelfDestructingSolverStorable2 [2022-04-15 04:14:06,564 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:14:06,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:14:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-15 04:14:06,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:14:06,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346846052] [2022-04-15 04:14:06,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:14:06,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:14:06,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543435403] [2022-04-15 04:14:06,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:06,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:06,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:14:06,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:14:06,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 04:14:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:06,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 04:14:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:06,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:14:06,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {670#true} is VALID [2022-04-15 04:14:06,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-15 04:14:06,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:06,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {670#true} is VALID [2022-04-15 04:14:06,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:06,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:06,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {670#true} is VALID [2022-04-15 04:14:06,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:06,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:06,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {670#true} is VALID [2022-04-15 04:14:06,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {670#true} is VALID [2022-04-15 04:14:06,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {670#true} is VALID [2022-04-15 04:14:06,836 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-15 04:14:06,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} [89] __VERIFIER_assertENTRY-->L16: 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] {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:14:06,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L16-->L16-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[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:14:06,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:14:06,840 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-15 04:14:06,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-15 04:14:06,842 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:14:06,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: 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] {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:14:06,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: 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[] {671#false} is VALID [2022-04-15 04:14:06,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-15 04:14:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 04:14:06,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:14:13,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-15 04:14:13,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: 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[] {671#false} is VALID [2022-04-15 04:14:13,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: 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] {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:14:13,149 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:14:13,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-15 04:14:13,152 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-15 04:14:13,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:14:13,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L16-->L16-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[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 04:14:13,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} [89] __VERIFIER_assertENTRY-->L16: 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] {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 04:14:13,168 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-15 04:14:13,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {670#true} is VALID [2022-04-15 04:14:13,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {670#true} is VALID [2022-04-15 04:14:13,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {670#true} is VALID [2022-04-15 04:14:13,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {670#true} is VALID [2022-04-15 04:14:13,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-15 04:14:13,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-15 04:14:13,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {670#true} is VALID [2022-04-15 04:14:13,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-15 04:14:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 04:14:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:14:13,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346846052] [2022-04-15 04:14:13,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:14:13,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543435403] [2022-04-15 04:14:13,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543435403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:14:13,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:14:13,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 04:14:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394271147] [2022-04-15 04:14:13,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:14:13,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-15 04:14:13,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:14:13,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 04:14:13,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:13,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 04:14:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:14:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 04:14:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 04:14:13,202 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 04:14:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:13,459 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 04:14:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 04:14:13,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-15 04:14:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:14:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 04:14:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 04:14:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 04:14:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 04:14:13,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 04:14:13,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:13,497 INFO L225 Difference]: With dead ends: 39 [2022-04-15 04:14:13,497 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 04:14:13,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 04:14:13,500 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:14:13,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:14:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 04:14:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-15 04:14:13,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:14:13,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:13,517 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:13,517 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:13,519 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 04:14:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 04:14:13,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:13,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:13,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 04:14:13,524 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 04:14:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:13,530 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 04:14:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 04:14:13,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:13,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:13,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:14:13,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:14:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:14:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 04:14:13,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-15 04:14:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:14:13,540 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 04:14:13,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 04:14:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 04:14:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 04:14:13,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:14:13,541 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:14:13,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 04:14:13,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:13,742 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:14:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:14:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-15 04:14:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:14:13,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916982740] [2022-04-15 04:14:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:14:13,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:14:13,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321767498] [2022-04-15 04:14:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:13,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:13,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:14:13,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:14:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 04:14:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:13,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 04:14:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:14:13,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:14:13,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:13,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#(<= ~counter~0 0)} {1024#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {1032#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(<= ~counter~0 0)} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,995 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= ~counter~0 0)} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,997 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:13,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:13,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:13,999 INFO L272 TraceCheckUtils]: 19: Hoare triple {1081#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L16: 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] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(<= ~counter~0 1)} [93] L16-->L16-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[] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(<= ~counter~0 1)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,001 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1081#(<= ~counter~0 1)} {1081#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1109#(<= |main_#t~post6| 1)} is VALID [2022-04-15 04:14:14,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1025#false} is VALID [2022-04-15 04:14:14,003 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1025#false} is VALID [2022-04-15 04:14:14,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} [89] __VERIFIER_assertENTRY-->L16: 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] {1025#false} is VALID [2022-04-15 04:14:14,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} [92] L16-->L17: 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[] {1025#false} is VALID [2022-04-15 04:14:14,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#false} is VALID [2022-04-15 04:14:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 04:14:14,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:14:14,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#false} is VALID [2022-04-15 04:14:14,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} [92] L16-->L17: 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[] {1025#false} is VALID [2022-04-15 04:14:14,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} [89] __VERIFIER_assertENTRY-->L16: 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] {1025#false} is VALID [2022-04-15 04:14:14,199 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1025#false} is VALID [2022-04-15 04:14:14,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1025#false} is VALID [2022-04-15 04:14:14,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1109#(<= |main_#t~post6| 1)} is VALID [2022-04-15 04:14:14,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,202 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1024#true} {1081#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:14,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} [93] L16-->L16-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[] {1024#true} is VALID [2022-04-15 04:14:14,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#true} [89] __VERIFIER_assertENTRY-->L16: 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] {1024#true} is VALID [2022-04-15 04:14:14,204 INFO L272 TraceCheckUtils]: 19: Hoare triple {1081#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1024#true} is VALID [2022-04-15 04:14:14,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1081#(<= ~counter~0 1)} is VALID [2022-04-15 04:14:14,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,207 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1024#true} {1032#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:14,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:14,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1024#true} is VALID [2022-04-15 04:14:14,207 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1024#true} is VALID [2022-04-15 04:14:14,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1032#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:14,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} [81] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:14,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} [78] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1024#true} is VALID [2022-04-15 04:14:14,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {1032#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1024#true} is VALID [2022-04-15 04:14:14,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#(<= ~counter~0 0)} {1024#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {1032#(<= ~counter~0 0)} is VALID [2022-04-15 04:14:14,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-15 04:14:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 04:14:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:14:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916982740] [2022-04-15 04:14:14,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:14:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321767498] [2022-04-15 04:14:14,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321767498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:14:14,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:14:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 04:14:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143324744] [2022-04-15 04:14:14,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:14:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 32 [2022-04-15 04:14:14,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:14:14,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 04:14:14,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:14,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:14:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:14:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:14:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 04:14:14,252 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 04:14:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:14,339 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 04:14:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 04:14:14,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 32 [2022-04-15 04:14:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:14:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 04:14:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 04:14:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 04:14:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 04:14:14,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 04:14:14,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:14:14,376 INFO L225 Difference]: With dead ends: 43 [2022-04-15 04:14:14,376 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 04:14:14,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 04:14:14,377 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:14:14,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:14:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 04:14:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 04:14:14,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:14:14,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:14,388 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:14,388 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:14,390 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 04:14:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 04:14:14,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:14,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:14,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 04:14:14,390 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 04:14:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:14:14,392 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 04:14:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 04:14:14,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:14:14,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:14:14,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:14:14,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:14:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:14:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 04:14:14,394 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-15 04:14:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:14:14,394 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 04:14:14,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 04:14:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 04:14:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 04:14:14,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:14:14,395 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:14:14,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 04:14:14,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:14,603 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:14:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:14:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1377493560, now seen corresponding path program 2 times [2022-04-15 04:14:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:14:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452138755] [2022-04-15 04:14:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:14:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:14:14,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:14:14,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867145058] [2022-04-15 04:14:14,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 04:14:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:14:14,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:14:14,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 04:14:14,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 04:14:14,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 04:14:14,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 04:14:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 04:14:14,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 04:14:14,715 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 04:14:14,716 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 04:14:14,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 04:14:14,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:14:14,942 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-15 04:14:14,945 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 04:14:14,972 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 04:14:14,973 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 04:14:14,974 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 04:14:14,974 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 04:14:14,974 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 04:14:14,974 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 04:14:14,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:14:14 BasicIcfg [2022-04-15 04:14:14,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 04:14:14,975 INFO L158 Benchmark]: Toolchain (without parser) took 11585.35ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 116.8MB in the end (delta: 12.9MB). Peak memory consumption was 51.5MB. Max. memory is 8.0GB. [2022-04-15 04:14:14,976 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 145.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 04:14:14,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.61ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 129.4MB in the beginning and 195.5MB in the end (delta: -66.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 04:14:14,976 INFO L158 Benchmark]: Boogie Preprocessor took 44.25ms. Allocated memory is still 219.2MB. Free memory was 195.5MB in the beginning and 194.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 04:14:14,976 INFO L158 Benchmark]: RCFGBuilder took 327.01ms. Allocated memory is still 219.2MB. Free memory was 194.0MB in the beginning and 182.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 04:14:14,977 INFO L158 Benchmark]: IcfgTransformer took 38.20ms. Allocated memory is still 219.2MB. Free memory was 182.4MB in the beginning and 180.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 04:14:14,977 INFO L158 Benchmark]: TraceAbstraction took 10826.34ms. Allocated memory is still 219.2MB. Free memory was 180.3MB in the beginning and 116.8MB in the end (delta: 63.5MB). Peak memory consumption was 63.4MB. Max. memory is 8.0GB. [2022-04-15 04:14:14,978 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 145.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 331.61ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 129.4MB in the beginning and 195.5MB in the end (delta: -66.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.25ms. Allocated memory is still 219.2MB. Free memory was 195.5MB in the beginning and 194.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.01ms. Allocated memory is still 219.2MB. Free memory was 194.0MB in the beginning and 182.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 38.20ms. Allocated memory is still 219.2MB. Free memory was 182.4MB in the beginning and 180.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 10826.34ms. Allocated memory is still 219.2MB. Free memory was 180.3MB in the beginning and 116.8MB in the end (delta: 63.5MB). Peak memory consumption was 63.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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=3, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=3, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=3, x2=1, y1=0, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=3, x2=1, y1=0, y2=0, y3=3] [L36] COND TRUE counter++<2 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=3, x2=1, y1=0, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=3, x2=1, y1=0, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=3, x2=1, y1=1, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=3, x2=1, y1=1, y2=0, y3=2] [L36] COND TRUE counter++<2 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=3, x2=1, y1=1, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=3, x2=1, y1=1, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=3, x2=1, y1=2, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=3, x2=1, y1=2, y2=0, y3=1] [L36] COND FALSE !(counter++<2) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 126 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 419 SizeOfPredicates, 13 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 34/40 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 04:14:14,994 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...