/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/egcd2-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 00:38:47,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 00:38:47,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 00:38:48,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 00:38:48,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 00:38:48,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 00:38:48,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 00:38:48,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 00:38:48,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 00:38:48,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 00:38:48,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 00:38:48,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 00:38:48,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 00:38:48,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 00:38:48,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 00:38:48,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 00:38:48,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 00:38:48,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 00:38:48,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 00:38:48,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 00:38:48,036 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 00:38:48,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 00:38:48,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 00:38:48,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 00:38:48,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 00:38:48,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 00:38:48,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 00:38:48,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 00:38:48,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 00:38:48,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 00:38:48,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 00:38:48,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 00:38:48,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 00:38:48,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 00:38:48,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 00:38:48,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 00:38:48,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 00:38:48,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 00:38:48,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 00:38:48,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 00:38:48,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 00:38:48,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 00:38:48,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 00:38:48,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 00:38:48,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 00:38:48,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 00:38:48,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 00:38:48,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 00:38:48,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 00:38:48,092 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 00:38:48,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 00:38:48,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 00:38:48,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 00:38:48,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 00:38:48,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 00:38:48,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 00:38:48,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 00:38:48,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 00:38:48,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 00:38:48,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 00:38:48,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 00:38:48,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 00:38:48,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:38:48,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 00:38:48,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 00:38:48,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 00:38:48,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 00:38:48,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 00:38:48,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 00:38:48,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 00:38:48,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 00:38:48,097 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 00:38:48,097 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-08 00:38:48,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 00:38:48,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 00:38:48,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 00:38:48,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 00:38:48,398 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 00:38:48,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c [2022-04-08 00:38:48,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7345bb01/4fe4bf61f84741709708393f71d99415/FLAG85f19b335 [2022-04-08 00:38:48,858 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 00:38:48,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c [2022-04-08 00:38:48,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7345bb01/4fe4bf61f84741709708393f71d99415/FLAG85f19b335 [2022-04-08 00:38:48,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7345bb01/4fe4bf61f84741709708393f71d99415 [2022-04-08 00:38:48,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 00:38:48,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 00:38:48,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 00:38:48,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 00:38:48,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 00:38:48,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:38:48" (1/1) ... [2022-04-08 00:38:48,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef460c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:48, skipping insertion in model container [2022-04-08 00:38:48,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:38:48" (1/1) ... [2022-04-08 00:38:48,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 00:38:48,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 00:38:49,098 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/egcd2-ll_unwindbound1.c[490,503] [2022-04-08 00:38:49,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:38:49,131 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 00:38:49,141 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/egcd2-ll_unwindbound1.c[490,503] [2022-04-08 00:38:49,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:38:49,164 INFO L208 MainTranslator]: Completed translation [2022-04-08 00:38:49,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49 WrapperNode [2022-04-08 00:38:49,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 00:38:49,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 00:38:49,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 00:38:49,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 00:38:49,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 00:38:49,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 00:38:49,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 00:38:49,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 00:38:49,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:38:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:49,234 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-08 00:38:49,251 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-08 00:38:49,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 00:38:49,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 00:38:49,280 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 00:38:49,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 00:38:49,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 00:38:49,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 00:38:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 00:38:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 00:38:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 00:38:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 00:38:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 00:38:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 00:38:49,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 00:38:49,366 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 00:38:49,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 00:38:49,592 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 00:38:49,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 00:38:49,600 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 00:38:49,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:38:49 BoogieIcfgContainer [2022-04-08 00:38:49,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 00:38:49,603 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 00:38:49,603 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 00:38:49,604 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 00:38:49,607 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:38:49" (1/1) ... [2022-04-08 00:38:49,609 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 00:38:49,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:38:49 BasicIcfg [2022-04-08 00:38:49,636 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 00:38:49,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 00:38:49,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 00:38:49,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 00:38:49,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:38:48" (1/4) ... [2022-04-08 00:38:49,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661280c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:38:49, skipping insertion in model container [2022-04-08 00:38:49,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:38:49" (2/4) ... [2022-04-08 00:38:49,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661280c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:38:49, skipping insertion in model container [2022-04-08 00:38:49,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:38:49" (3/4) ... [2022-04-08 00:38:49,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661280c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:38:49, skipping insertion in model container [2022-04-08 00:38:49,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:38:49" (4/4) ... [2022-04-08 00:38:49,644 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound1.cqvasr [2022-04-08 00:38:49,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 00:38:49,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 00:38:49,693 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 00:38:49,700 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-08 00:38:49,700 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 00:38:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 00:38:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 00:38:49,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:49,733 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:49,735 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-04-08 00:38:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:49,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841109775] [2022-04-08 00:38:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:49,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:49,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453631210] [2022-04-08 00:38:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:49,901 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-08 00:38:49,906 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-08 00:38:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:49,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 00:38:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:50,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:50,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [103] 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) (= (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) (= v_~counter~0_5 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_5, #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] {42#true} is VALID [2022-04-08 00:38:50,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {42#true} is VALID [2022-04-08 00:38:50,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-08 00:38:50,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-08 00:38:50,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,145 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-08 00:38:50,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-08 00:38:50,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,146 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {42#true} is VALID [2022-04-08 00:38:50,147 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-08 00:38:50,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-08 00:38:50,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,148 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,148 INFO L272 TraceCheckUtils]: 22: Hoare triple {42#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: 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] {42#true} is VALID [2022-04-08 00:38:50,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} [112] L8-->L8-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[] {42#true} is VALID [2022-04-08 00:38:50,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-08 00:38:50,149 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42#true} {42#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-08 00:38:50,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#true} [116] L40-2-->L40-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-08 00:38:50,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {43#false} is VALID [2022-04-08 00:38:50,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} [122] __VERIFIER_assertENTRY-->L11: 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] {43#false} is VALID [2022-04-08 00:38:50,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} [126] L11-->L12: 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[] {43#false} is VALID [2022-04-08 00:38:50,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-08 00:38:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:38:50,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:38:50,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:50,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841109775] [2022-04-08 00:38:50,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:50,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453631210] [2022-04-08 00:38:50,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453631210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:38:50,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:38:50,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 00:38:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351171576] [2022-04-08 00:38:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:38:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-08 00:38:50,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:50,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:38:50,194 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-08 00:38:50,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 00:38:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 00:38:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 00:38:50,238 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:38:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:50,341 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-08 00:38:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 00:38:50,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-08 00:38:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:38:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-04-08 00:38:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:38:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-04-08 00:38:50,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2022-04-08 00:38:50,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:50,512 INFO L225 Difference]: With dead ends: 71 [2022-04-08 00:38:50,516 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 00:38:50,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 00:38:50,523 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:50,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:38:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 00:38:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 00:38:50,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:50,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:50,554 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:50,554 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:50,560 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 00:38:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 00:38:50,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:50,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:50,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 00:38:50,564 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 00:38:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:50,569 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 00:38:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 00:38:50,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:50,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:50,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:50,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 00:38:50,585 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-08 00:38:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:50,585 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-08 00:38:50,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 00:38:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 00:38:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 00:38:50,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:50,590 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:50,617 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-08 00:38:50,803 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-08 00:38:50,804 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-04-08 00:38:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:50,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654828036] [2022-04-08 00:38:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:50,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:50,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618257288] [2022-04-08 00:38:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:50,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:50,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:50,852 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-08 00:38:50,889 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-08 00:38:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:50,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 00:38:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:50,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:51,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {361#true} is VALID [2022-04-08 00:38:51,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} [103] 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) (= (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) (= v_~counter~0_5 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_5, #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] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#(<= ~counter~0 0)} {361#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {369#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#(<= ~counter~0 0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {369#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-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[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,233 INFO L272 TraceCheckUtils]: 11: Hoare triple {369#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-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[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {369#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,237 INFO L272 TraceCheckUtils]: 17: Hoare triple {369#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-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[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,239 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,239 INFO L272 TraceCheckUtils]: 22: Hoare triple {369#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {369#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: 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] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {369#(<= ~counter~0 0)} [112] L8-->L8-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[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {369#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,241 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {369#(<= ~counter~0 0)} {369#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {369#(<= ~counter~0 0)} is VALID [2022-04-08 00:38:51,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {369#(<= ~counter~0 0)} [117] L40-2-->L40: 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] {448#(<= |main_#t~post6| 0)} is VALID [2022-04-08 00:38:51,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {448#(<= |main_#t~post6| 0)} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {362#false} is VALID [2022-04-08 00:38:51,244 INFO L272 TraceCheckUtils]: 29: Hoare triple {362#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {362#false} is VALID [2022-04-08 00:38:51,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {362#false} [122] __VERIFIER_assertENTRY-->L11: 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] {362#false} is VALID [2022-04-08 00:38:51,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {362#false} [126] L11-->L12: 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[] {362#false} is VALID [2022-04-08 00:38:51,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {362#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#false} is VALID [2022-04-08 00:38:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:38:51,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:38:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:51,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654828036] [2022-04-08 00:38:51,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:51,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618257288] [2022-04-08 00:38:51,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618257288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:38:51,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:38:51,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 00:38:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290297884] [2022-04-08 00:38:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:38:51,249 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 00:38:51,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:51,249 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:51,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:51,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 00:38:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:51,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 00:38:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 00:38:51,290 INFO L87 Difference]: Start difference. First operand 34 states and 45 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:51,442 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-08 00:38:51,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 00:38:51,442 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 00:38:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:51,443 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 00:38:51,448 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 00:38:51,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-08 00:38:51,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:51,510 INFO L225 Difference]: With dead ends: 44 [2022-04-08 00:38:51,510 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 00:38:51,510 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-08 00:38:51,513 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:51,514 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:38:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 00:38:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 00:38:51,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:51,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:51,538 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:51,540 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:51,549 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 00:38:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 00:38:51,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:51,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:51,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-08 00:38:51,554 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-08 00:38:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:51,564 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 00:38:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 00:38:51,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:51,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:51,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:51,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-08 00:38:51,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-08 00:38:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:51,570 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-08 00:38:51,570 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 00:38:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 00:38:51,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:51,575 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:51,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 00:38:51,776 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-08 00:38:51,777 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:51,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-04-08 00:38:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:51,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281036641] [2022-04-08 00:38:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:51,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:51,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690905222] [2022-04-08 00:38:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:51,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:51,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:51,821 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-08 00:38:51,822 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-08 00:38:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:51,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 00:38:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:51,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:52,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#true} [103] 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) (= (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) (= v_~counter~0_5 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_5, #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] {656#true} is VALID [2022-04-08 00:38:52,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {656#true} is VALID [2022-04-08 00:38:52,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {656#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {656#true} is VALID [2022-04-08 00:38:52,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {656#true} [112] L8-->L8-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[] {656#true} is VALID [2022-04-08 00:38:52,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {656#true} {656#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,086 INFO L272 TraceCheckUtils]: 11: Hoare triple {656#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {697#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:38:52,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-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[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:52,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:52,088 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {701#(not (= |assume_abort_if_not_#in~cond| 0))} {656#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {708#(<= 1 main_~y~0)} is VALID [2022-04-08 00:38:52,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,089 INFO L272 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {656#true} is VALID [2022-04-08 00:38:52,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#true} [112] L8-->L8-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[] {656#true} is VALID [2022-04-08 00:38:52,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,092 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,092 INFO L272 TraceCheckUtils]: 22: Hoare triple {712#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {656#true} is VALID [2022-04-08 00:38:52,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [112] L8-->L8-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[] {656#true} is VALID [2022-04-08 00:38:52,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,096 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(<= 1 main_~b~0)} [117] L40-2-->L40: 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] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {712#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-08 00:38:52,097 INFO L272 TraceCheckUtils]: 30: Hoare triple {657#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {657#false} is VALID [2022-04-08 00:38:52,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {657#false} [122] __VERIFIER_assertENTRY-->L11: 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] {657#false} is VALID [2022-04-08 00:38:52,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#false} [126] L11-->L12: 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[] {657#false} is VALID [2022-04-08 00:38:52,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {657#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-08 00:38:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 00:38:52,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:38:52,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {657#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-08 00:38:52,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#false} [126] L11-->L12: 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[] {657#false} is VALID [2022-04-08 00:38:52,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {657#false} [122] __VERIFIER_assertENTRY-->L11: 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] {657#false} is VALID [2022-04-08 00:38:52,376 INFO L272 TraceCheckUtils]: 30: Hoare triple {657#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {657#false} is VALID [2022-04-08 00:38:52,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {712#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-08 00:38:52,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {712#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(<= 1 main_~b~0)} [117] L40-2-->L40: 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] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,383 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [112] L8-->L8-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[] {656#true} is VALID [2022-04-08 00:38:52,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {656#true} is VALID [2022-04-08 00:38:52,385 INFO L272 TraceCheckUtils]: 22: Hoare triple {712#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,386 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {656#true} {712#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#true} [112] L8-->L8-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[] {656#true} is VALID [2022-04-08 00:38:52,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {656#true} is VALID [2022-04-08 00:38:52,390 INFO L272 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {712#(<= 1 main_~b~0)} is VALID [2022-04-08 00:38:52,393 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {701#(not (= |assume_abort_if_not_#in~cond| 0))} {656#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {708#(<= 1 main_~y~0)} is VALID [2022-04-08 00:38:52,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:52,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {827#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [112] L8-->L8-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[] {701#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:38:52,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {827#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 00:38:52,409 INFO L272 TraceCheckUtils]: 11: Hoare triple {656#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {656#true} {656#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {656#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {656#true} [112] L8-->L8-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[] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#true} [109] assume_abort_if_notENTRY-->L8: 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] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {656#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {656#true} is VALID [2022-04-08 00:38:52,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#true} [103] 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) (= (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) (= v_~counter~0_5 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_5, #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] {656#true} is VALID [2022-04-08 00:38:52,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-08 00:38:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 00:38:52,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:52,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281036641] [2022-04-08 00:38:52,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:52,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690905222] [2022-04-08 00:38:52,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690905222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:38:52,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:38:52,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-08 00:38:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899096670] [2022-04-08 00:38:52,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:38:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 00:38:52,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:52,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:52,442 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-08 00:38:52,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 00:38:52,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 00:38:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 00:38:52,444 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:52,904 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-08 00:38:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 00:38:52,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 00:38:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 00:38:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 00:38:52,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-08 00:38:52,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:52,975 INFO L225 Difference]: With dead ends: 53 [2022-04-08 00:38:52,975 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 00:38:52,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 00:38:52,977 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:52,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:38:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 00:38:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-08 00:38:53,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:53,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:53,005 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:53,005 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:53,008 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-08 00:38:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 00:38:53,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:53,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:53,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 00:38:53,010 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 00:38:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:53,013 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-08 00:38:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 00:38:53,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:53,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:53,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:53,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 00:38:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-08 00:38:53,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-08 00:38:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:53,017 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-08 00:38:53,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-08 00:38:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 00:38:53,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:53,018 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:53,042 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-08 00:38:53,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:53,240 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-04-08 00:38:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344255224] [2022-04-08 00:38:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:53,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:53,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126408738] [2022-04-08 00:38:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:53,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:53,266 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-08 00:38:53,268 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-08 00:38:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:53,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 00:38:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:38:53,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:38:53,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {1096#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#true} is VALID [2022-04-08 00:38:53,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#true} [103] 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) (= (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) (= v_~counter~0_5 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_5, #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] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1104#(<= 0 ~counter~0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1104#(<= 0 ~counter~0)} {1096#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {1104#(<= 0 ~counter~0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {1104#(<= 0 ~counter~0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {1104#(<= 0 ~counter~0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {1104#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#(<= 0 ~counter~0)} [112] L8-->L8-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[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1104#(<= 0 ~counter~0)} {1104#(<= 0 ~counter~0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {1104#(<= 0 ~counter~0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#(<= 0 ~counter~0)} [112] L8-->L8-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[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,528 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1104#(<= 0 ~counter~0)} {1104#(<= 0 ~counter~0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(<= 0 ~counter~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,529 INFO L272 TraceCheckUtils]: 17: Hoare triple {1104#(<= 0 ~counter~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(<= 0 ~counter~0)} [112] L8-->L8-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[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {1104#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,530 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1104#(<= 0 ~counter~0)} {1104#(<= 0 ~counter~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,531 INFO L272 TraceCheckUtils]: 22: Hoare triple {1104#(<= 0 ~counter~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {1104#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: 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] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(<= 0 ~counter~0)} [112] L8-->L8-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[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {1104#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,533 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1104#(<= 0 ~counter~0)} {1104#(<= 0 ~counter~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1104#(<= 0 ~counter~0)} is VALID [2022-04-08 00:38:53,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {1104#(<= 0 ~counter~0)} [117] L40-2-->L40: 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] {1183#(<= 1 ~counter~0)} is VALID [2022-04-08 00:38:53,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {1183#(<= 1 ~counter~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1183#(<= 1 ~counter~0)} is VALID [2022-04-08 00:38:53,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {1183#(<= 1 ~counter~0)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1183#(<= 1 ~counter~0)} is VALID [2022-04-08 00:38:53,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {1183#(<= 1 ~counter~0)} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1193#(<= 1 |main_#t~post7|)} is VALID [2022-04-08 00:38:53,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {1193#(<= 1 |main_#t~post7|)} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 1) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1097#false} is VALID [2022-04-08 00:38:53,535 INFO L272 TraceCheckUtils]: 32: Hoare triple {1097#false} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1097#false} is VALID [2022-04-08 00:38:53,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {1097#false} [122] __VERIFIER_assertENTRY-->L11: 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] {1097#false} is VALID [2022-04-08 00:38:53,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {1097#false} [126] L11-->L12: 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[] {1097#false} is VALID [2022-04-08 00:38:53,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {1097#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1097#false} is VALID [2022-04-08 00:38:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 00:38:53,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:38:53,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:38:53,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344255224] [2022-04-08 00:38:53,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:38:53,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126408738] [2022-04-08 00:38:53,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126408738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:38:53,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:38:53,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:38:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027657848] [2022-04-08 00:38:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:38:53,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-08 00:38:53,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:38:53,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:53,559 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-08 00:38:53,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:38:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:38:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:38:53,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:38:53,560 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:53,668 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-08 00:38:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:38:53,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-08 00:38:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:38:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 00:38:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 00:38:53,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-08 00:38:53,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:38:53,726 INFO L225 Difference]: With dead ends: 51 [2022-04-08 00:38:53,726 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 00:38:53,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 00:38:53,728 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:38:53,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:38:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 00:38:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 00:38:53,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:38:53,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:38:53,798 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:38:53,799 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:38:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:53,800 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 00:38:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 00:38:53,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:53,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:53,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-08 00:38:53,801 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-08 00:38:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:38:53,802 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 00:38:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 00:38:53,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:38:53,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:38:53,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:38:53,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:38:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 00:38:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 00:38:53,804 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 36 [2022-04-08 00:38:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:38:53,805 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 00:38:53,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:38:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 00:38:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 00:38:53,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:38:53,805 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:38:53,833 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-08 00:38:54,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:54,006 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:38:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:38:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-04-08 00:38:54,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:38:54,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59823018] [2022-04-08 00:38:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:38:54,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:38:54,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198808666] [2022-04-08 00:38:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:38:54,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:54,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:38:54,036 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-08 00:38:54,038 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-08 00:38:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 00:38:54,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 00:38:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 00:38:54,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 00:38:54,191 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 00:38:54,192 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 00:38:54,220 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-08 00:38:54,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:38:54,418 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-08 00:38:54,422 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 00:38:54,454 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 00:38:54,454 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 00:38:54,454 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 00:38:54,454 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 00:38:54,454 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:54,455 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 00:38:54,456 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 00:38:54,457 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-08 00:38:54,457 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-08 00:38:54,457 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 00:38:54,457 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 00:38:54,457 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 00:38:54,457 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-08 00:38:54,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:38:54 BasicIcfg [2022-04-08 00:38:54,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 00:38:54,460 INFO L158 Benchmark]: Toolchain (without parser) took 5572.79ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 128.7MB in the beginning and 96.9MB in the end (delta: 31.7MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. [2022-04-08 00:38:54,461 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 00:38:54,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.78ms. Allocated memory is still 183.5MB. Free memory was 128.6MB in the beginning and 155.4MB in the end (delta: -26.8MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-04-08 00:38:54,461 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 183.5MB. Free memory was 155.4MB in the beginning and 154.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 00:38:54,461 INFO L158 Benchmark]: RCFGBuilder took 403.43ms. Allocated memory is still 183.5MB. Free memory was 154.0MB in the beginning and 140.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 00:38:54,462 INFO L158 Benchmark]: IcfgTransformer took 33.98ms. Allocated memory is still 183.5MB. Free memory was 140.7MB in the beginning and 138.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 00:38:54,462 INFO L158 Benchmark]: TraceAbstraction took 4819.71ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 138.2MB in the beginning and 96.9MB in the end (delta: 41.3MB). Peak memory consumption was 78.9MB. Max. memory is 8.0GB. [2022-04-08 00:38:54,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.78ms. Allocated memory is still 183.5MB. Free memory was 128.6MB in the beginning and 155.4MB in the end (delta: -26.8MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 183.5MB. Free memory was 155.4MB in the beginning and 154.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.43ms. Allocated memory is still 183.5MB. Free memory was 154.0MB in the beginning and 140.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 33.98ms. Allocated memory is still 183.5MB. Free memory was 140.7MB in the beginning and 138.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4819.71ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 138.2MB in the beginning and 96.9MB in the end (delta: 41.3MB). Peak memory consumption was 78.9MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=6, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=1, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=1, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L40] COND TRUE counter++<1 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1, b=1, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L46] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1] [L46] COND FALSE !(counter++<1) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=1, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=1, y=1, yy=1] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=1, y=1, yy=1] [L40] COND FALSE !(counter++<1) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 365 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 163 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 5 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 108/120 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-08 00:38:54,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...