/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/geo3-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:40:57,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:40:57,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:40:57,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:40:57,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:40:57,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:40:57,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:40:57,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:40:57,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:40:57,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:40:57,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:40:57,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:40:57,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:40:57,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:40:57,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:40:57,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:40:57,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:40:57,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:40:57,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:40:57,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:40:57,504 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:40:57,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:40:57,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:40:57,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:40:57,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:40:57,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:40:57,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:40:57,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:40:57,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:40:57,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:40:57,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:40:57,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:40:57,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:40:57,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:40:57,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:40:57,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:40:57,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:40:57,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:40:57,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:40:57,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:40:57,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:40:57,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:40:57,529 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 01:40:57,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:40:57,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:40:57,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:40:57,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:40:57,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:40:57,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:40:57,555 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:40:57,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:40:57,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:40:57,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:40:57,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:40:57,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:40:57,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:40:57,558 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:40:57,558 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 01:40:57,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:40:57,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:40:57,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:40:57,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:40:57,774 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:40:57,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-04-15 01:40:57,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46573cc7a/42f70bedad4a452c873fa3bed50b790c/FLAG0e993f65b [2022-04-15 01:40:58,217 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:40:58,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-04-15 01:40:58,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46573cc7a/42f70bedad4a452c873fa3bed50b790c/FLAG0e993f65b [2022-04-15 01:40:58,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46573cc7a/42f70bedad4a452c873fa3bed50b790c [2022-04-15 01:40:58,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:40:58,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:40:58,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:40:58,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:40:58,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:40:58,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aba96cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58, skipping insertion in model container [2022-04-15 01:40:58,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:40:58,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:40:58,773 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/geo3-ll.c[525,538] [2022-04-15 01:40:58,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:40:58,804 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:40:58,812 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/geo3-ll.c[525,538] [2022-04-15 01:40:58,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:40:58,828 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:40:58,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58 WrapperNode [2022-04-15 01:40:58,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:40:58,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:40:58,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:40:58,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:40:58,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:40:58,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:40:58,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:40:58,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:40:58,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (1/1) ... [2022-04-15 01:40:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:40:58,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:40:58,880 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 01:40:58,882 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 01:40:58,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:40:58,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:40:58,914 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:40:58,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 01:40:58,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:40:58,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:40:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:40:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:40:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:40:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:40:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:40:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 01:40:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:40:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:40:58,963 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:40:58,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:40:59,108 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:40:59,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:40:59,116 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:40:59,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:40:59 BoogieIcfgContainer [2022-04-15 01:40:59,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:40:59,118 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:40:59,118 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:40:59,118 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:40:59,120 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:40:59" (1/1) ... [2022-04-15 01:40:59,121 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:40:59,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:40:59 BasicIcfg [2022-04-15 01:40:59,136 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:40:59,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:40:59,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:40:59,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:40:59,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:40:58" (1/4) ... [2022-04-15 01:40:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d26e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:40:59, skipping insertion in model container [2022-04-15 01:40:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:40:58" (2/4) ... [2022-04-15 01:40:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d26e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:40:59, skipping insertion in model container [2022-04-15 01:40:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:40:59" (3/4) ... [2022-04-15 01:40:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d26e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:40:59, skipping insertion in model container [2022-04-15 01:40:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:40:59" (4/4) ... [2022-04-15 01:40:59,145 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll.cqvasr [2022-04-15 01:40:59,148 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:40:59,148 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:40:59,175 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:40:59,180 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 01:40:59,180 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:40:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 01:40:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 01:40:59,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:40:59,196 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:40:59,196 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:40:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:40:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1229966674, now seen corresponding path program 1 times [2022-04-15 01:40:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:40:59,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754364061] [2022-04-15 01:40:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:40:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:40:59,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 01:40:59,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35559434] [2022-04-15 01:40:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:40:59,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:40:59,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:40:59,300 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 01:40:59,342 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 01:40:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:40:59,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 01:40:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:40:59,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:40:59,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:40:59,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-15 01:40:59,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [61] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:40:59,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:40:59,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [57] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:40:59,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [60] mainENTRY-->L33-2: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 v_main_~x~0_4) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~z~0_3 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (= v_main_~c~0_4 1) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet6_2|) (= (* v_main_~a~0_3 v_main_~z~0_3) v_main_~az~0_2) (= v_main_~y~0_4 1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_4, main_~y~0=v_main_~y~0_4, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {44#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 01:40:59,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 01:40:59,571 INFO L272 TraceCheckUtils]: 7: Hoare triple {44#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {51#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:40:59,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {55#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:40:59,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {55#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:40:59,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:40:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:40:59,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 01:40:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:40:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754364061] [2022-04-15 01:40:59,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 01:40:59,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35559434] [2022-04-15 01:40:59,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35559434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:40:59,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:40:59,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 01:40:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611401042] [2022-04-15 01:40:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:40:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 01:40:59,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:40:59,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:40:59,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:40:59,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 01:40:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:40:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 01:40:59,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:40:59,622 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:40:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:40:59,746 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 01:40:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 01:40:59,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 01:40:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:40:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:40:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 01:40:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:40:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 01:40:59,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 01:40:59,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:40:59,807 INFO L225 Difference]: With dead ends: 47 [2022-04-15 01:40:59,808 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 01:40:59,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:40:59,811 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:40:59,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:40:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 01:40:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 01:40:59,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:40:59,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:40:59,830 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:40:59,831 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:40:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:40:59,833 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 01:40:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 01:40:59,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:40:59,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:40:59,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-15 01:40:59,834 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-15 01:40:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:40:59,835 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 01:40:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 01:40:59,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:40:59,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:40:59,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:40:59,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:40:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:40:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-15 01:40:59,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-04-15 01:40:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:40:59,853 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-15 01:40:59,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:40:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 01:40:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 01:40:59,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:40:59,854 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:40:59,875 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 01:41:00,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 01:41:00,055 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:41:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:41:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash 726352862, now seen corresponding path program 1 times [2022-04-15 01:41:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:41:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474573928] [2022-04-15 01:41:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:41:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:41:00,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 01:41:00,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102269200] [2022-04-15 01:41:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:41:00,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:41:00,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:41:00,068 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 01:41:00,069 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 01:41:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:41:00,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 01:41:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:41:00,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:41:00,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:41:00,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {206#true} is VALID [2022-04-15 01:41:00,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [61] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:41:00,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:41:00,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [57] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:41:00,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [60] mainENTRY-->L33-2: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 v_main_~x~0_4) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~z~0_3 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (= v_main_~c~0_4 1) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet6_2|) (= (* v_main_~a~0_3 v_main_~z~0_3) v_main_~az~0_2) (= v_main_~y~0_4 1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_4, main_~y~0=v_main_~y~0_4, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {226#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 01:41:00,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 01:41:00,276 INFO L272 TraceCheckUtils]: 7: Hoare triple {226#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {206#true} is VALID [2022-04-15 01:41:00,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#true} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {236#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:41:00,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:41:00,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:41:00,278 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {240#(not (= |__VERIFIER_assert_#in~cond| 0))} {226#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} [79] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {247#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} is VALID [2022-04-15 01:41:00,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} [70] L34-1-->L33-2: Formula: (and (= (* v_main_~y~0_3 v_main_~z~0_2) v_main_~y~0_2) (= v_main_~c~0_2 (+ v_main_~c~0_3 1)) (< v_main_~c~0_3 v_main_~k~0_2) (= v_main_~x~0_2 (+ v_main_~a~0_2 (* v_main_~x~0_3 v_main_~z~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~a~0=v_main_~a~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~y~0=v_main_~y~0_2, main_~c~0=v_main_~c~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {251#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-15 01:41:00,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-15 01:41:00,281 INFO L272 TraceCheckUtils]: 14: Hoare triple {251#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:41:00,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {258#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:41:00,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-15 01:41:00,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-15 01:41:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:41:00,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:41:23,425 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 01:42:05,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-15 01:42:05,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-15 01:42:05,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {258#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:42:05,898 INFO L272 TraceCheckUtils]: 14: Hoare triple {278#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:42:05,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {278#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 01:42:05,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} [70] L34-1-->L33-2: Formula: (and (= (* v_main_~y~0_3 v_main_~z~0_2) v_main_~y~0_2) (= v_main_~c~0_2 (+ v_main_~c~0_3 1)) (< v_main_~c~0_3 v_main_~k~0_2) (= v_main_~x~0_2 (+ v_main_~a~0_2 (* v_main_~x~0_3 v_main_~z~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~y~0=v_main_~y~0_3, main_~c~0=v_main_~c~0_3, main_~a~0=v_main_~a~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~y~0=v_main_~y~0_2, main_~c~0=v_main_~c~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {278#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 01:42:05,930 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {240#(not (= |__VERIFIER_assert_#in~cond| 0))} {206#true} [79] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {285#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 01:42:05,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:42:05,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:42:05,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#true} [68] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {298#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:42:05,931 INFO L272 TraceCheckUtils]: 7: Hoare triple {206#true} [66] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#true} [64] L33-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [60] mainENTRY-->L33-2: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 v_main_~x~0_4) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~z~0_3 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (= v_main_~c~0_4 1) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet6_2|) (= (* v_main_~a~0_3 v_main_~z~0_3) v_main_~az~0_2) (= v_main_~y~0_4 1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_4, main_~y~0=v_main_~y~0_4, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [57] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [61] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [58] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {206#true} is VALID [2022-04-15 01:42:05,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [56] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-15 01:42:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:42:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:42:05,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474573928] [2022-04-15 01:42:05,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 01:42:05,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102269200] [2022-04-15 01:42:05,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102269200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:42:05,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:42:05,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-15 01:42:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856161051] [2022-04-15 01:42:05,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 01:42:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2022-04-15 01:42:05,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:42:05,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 01:42:06,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:42:06,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 01:42:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:42:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 01:42:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 01:42:06,006 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 01:42:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:42:07,396 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 01:42:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 01:42:07,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2022-04-15 01:42:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:42:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 01:42:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-15 01:42:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 01:42:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-15 01:42:07,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-15 01:42:09,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:42:09,687 INFO L225 Difference]: With dead ends: 27 [2022-04-15 01:42:09,687 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:42:09,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:42:09,688 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:42:09,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 01:42:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:42:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:42:09,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:42:09,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:42:09,690 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:42:09,690 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:42:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:42:09,690 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:42:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:42:09,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:42:09,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:42:09,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:42:09,690 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:42:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:42:09,690 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:42:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:42:09,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:42:09,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:42:09,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:42:09,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:42:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:42:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:42:09,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-15 01:42:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:42:09,691 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:42:09,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 01:42:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:42:09,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:42:09,693 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:42:09,730 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 01:42:09,894 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,SelfDestructingSolverStorable1 [2022-04-15 01:42:09,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:42:09,993 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:42:09,993 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:42:09,994 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 45) the Hoare annotation is: true [2022-04-15 01:42:09,994 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 42) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-15 01:42:09,994 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 42) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-15 01:42:09,994 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point L34-1(lines 33 42) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 45) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 45) no Hoare annotation was computed. [2022-04-15 01:42:09,994 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 01:42:09,995 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-15 01:42:09,995 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-15 01:42:09,995 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-15 01:42:09,995 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-15 01:42:09,995 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-15 01:42:09,997 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 01:42:09,998 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:42:10,001 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:42:10,002 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:42:10,003 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:42:10,004 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:42:10,005 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:42:10,005 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:42:10,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:42:10 BasicIcfg [2022-04-15 01:42:10,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:42:10,020 INFO L158 Benchmark]: Toolchain (without parser) took 71390.49ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 114.7MB in the beginning and 115.4MB in the end (delta: -755.9kB). Peak memory consumption was 36.1MB. Max. memory is 8.0GB. [2022-04-15 01:42:10,020 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:42:10,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.91ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 114.4MB in the beginning and 182.5MB in the end (delta: -68.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-15 01:42:10,021 INFO L158 Benchmark]: Boogie Preprocessor took 18.93ms. Allocated memory is still 210.8MB. Free memory was 182.5MB in the beginning and 180.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:42:10,021 INFO L158 Benchmark]: RCFGBuilder took 267.88ms. Allocated memory is still 210.8MB. Free memory was 180.9MB in the beginning and 168.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 01:42:10,021 INFO L158 Benchmark]: IcfgTransformer took 18.50ms. Allocated memory is still 210.8MB. Free memory was 168.3MB in the beginning and 166.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:42:10,021 INFO L158 Benchmark]: TraceAbstraction took 70878.64ms. Allocated memory is still 210.8MB. Free memory was 166.8MB in the beginning and 115.4MB in the end (delta: 51.3MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. [2022-04-15 01:42:10,023 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.10ms. Allocated memory is still 175.1MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.91ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 114.4MB in the beginning and 182.5MB in the end (delta: -68.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.93ms. Allocated memory is still 210.8MB. Free memory was 182.5MB in the beginning and 180.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 267.88ms. Allocated memory is still 210.8MB. Free memory was 180.9MB in the beginning and 168.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 18.50ms. Allocated memory is still 210.8MB. Free memory was 168.3MB in the beginning and 166.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 70878.64ms. Allocated memory is still 210.8MB. Free memory was 166.8MB in the beginning and 115.4MB in the end (delta: 51.3MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 31 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=1, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 38 HoareAnnotationTreeSize, 15 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 66.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 4 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: y * az + x == z * x + a RESULT: Ultimate proved your program to be correct! [2022-04-15 01:42:10,039 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...