/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/egcd3-ll_unwindbound2.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 00:51:40,915 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 00:51:40,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 00:51:40,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 00:51:40,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 00:51:40,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 00:51:40,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 00:51:40,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 00:51:40,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 00:51:40,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 00:51:40,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 00:51:40,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 00:51:40,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 00:51:40,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 00:51:40,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 00:51:40,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 00:51:40,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 00:51:40,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 00:51:40,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 00:51:40,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 00:51:40,979 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 00:51:40,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 00:51:40,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 00:51:40,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 00:51:40,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 00:51:40,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 00:51:40,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 00:51:40,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 00:51:40,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 00:51:40,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 00:51:40,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 00:51:40,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 00:51:40,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 00:51:40,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 00:51:40,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 00:51:40,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 00:51:40,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 00:51:40,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 00:51:40,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 00:51:40,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 00:51:40,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 00:51:40,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 00:51:40,995 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:51:41,019 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 00:51:41,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 00:51:41,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-04-08 00:51:41,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-04-08 00:51:41,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-04-08 00:51:41,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-04-08 00:51:41,021 INFO L138 SettingsManager]: * Use SBE=true
[2022-04-08 00:51:41,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 00:51:41,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 00:51:41,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 00:51:41,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 00:51:41,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 00:51:41,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2022-04-08 00:51:41,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-04-08 00:51:41,025 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-08 00:51:41,025 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:51:41,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 00:51:41,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 00:51:41,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 00:51:41,195 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 00:51:41,197 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 00:51:41,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound2.c
[2022-04-08 00:51:41,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd6d5ee8/a8263d86126245c4b32e6e727c2d1f97/FLAGf4946ca95
[2022-04-08 00:51:41,653 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 00:51:41,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound2.c
[2022-04-08 00:51:41,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd6d5ee8/a8263d86126245c4b32e6e727c2d1f97/FLAGf4946ca95
[2022-04-08 00:51:41,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd6d5ee8/a8263d86126245c4b32e6e727c2d1f97
[2022-04-08 00:51:41,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 00:51:41,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-08 00:51:41,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 00:51:41,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 00:51:41,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 00:51:41,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e0442d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41, skipping insertion in model container
[2022-04-08 00:51:41,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 00:51:41,682 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 00:51:41,829 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/egcd3-ll_unwindbound2.c[490,503]
[2022-04-08 00:51:41,853 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 00:51:41,858 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 00:51:41,876 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/egcd3-ll_unwindbound2.c[490,503]
[2022-04-08 00:51:41,883 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 00:51:41,890 INFO L208 MainTranslator]: Completed translation
[2022-04-08 00:51:41,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41 WrapperNode
[2022-04-08 00:51:41,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 00:51:41,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 00:51:41,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 00:51:41,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 00:51:41,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 00:51:41,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 00:51:41,910 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 00:51:41,910 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 00:51:41,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (1/1) ...
[2022-04-08 00:51:41,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 00:51:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 00:51:41,928 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:51:41,933 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:51:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 00:51:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 00:51:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 00:51:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 00:51:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 00:51:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 00:51:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 00:51:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 00:51:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 00:51:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 00:51:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 00:51:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 00:51:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 00:51:41,991 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 00:51:41,992 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 00:51:42,119 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 00:51:42,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 00:51:42,124 INFO L299 CfgBuilder]: Removed 3 assume(true) statements.
[2022-04-08 00:51:42,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:51:42 BoogieIcfgContainer
[2022-04-08 00:51:42,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 00:51:42,125 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-08 00:51:42,125 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-08 00:51:42,135 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-08 00:51:42,137 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:51:42" (1/1) ...
[2022-04-08 00:51:42,138 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR
[2022-04-08 00:51:42,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:51:42 BasicIcfg
[2022-04-08 00:51:42,171 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-08 00:51:42,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 00:51:42,185 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 00:51:42,187 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 00:51:42,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:51:41" (1/4) ...
[2022-04-08 00:51:42,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc41f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:51:42, skipping insertion in model container
[2022-04-08 00:51:42,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:51:41" (2/4) ...
[2022-04-08 00:51:42,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc41f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:51:42, skipping insertion in model container
[2022-04-08 00:51:42,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:51:42" (3/4) ...
[2022-04-08 00:51:42,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc41f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:51:42, skipping insertion in model container
[2022-04-08 00:51:42,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:51:42" (4/4) ...
[2022-04-08 00:51:42,189 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound2.cqvasr
[2022-04-08 00:51:42,192 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-04-08 00:51:42,192 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 00:51:42,237 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 00:51:42,243 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:51:42,243 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 00:51:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 00:51:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 00:51:42,261 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 00:51:42,262 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:42,262 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 00:51:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 00:51:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times
[2022-04-08 00:51:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 00:51:42,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311269583]
[2022-04-08 00:51:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 00:51:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 00:51:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:42,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {43#true} is VALID
[2022-04-08 00:51:42,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID
[2022-04-08 00:51:42,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID
[2022-04-08 00:51:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 00:51:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:42,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] 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] {43#true} is VALID
[2022-04-08 00:51:42,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {44#false} is VALID
[2022-04-08 00:51:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-08 00:51:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:42,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] 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] {43#true} is VALID
[2022-04-08 00:51:42,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {44#false} is VALID
[2022-04-08 00:51:42,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 00:51:42,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {43#true} is VALID
[2022-04-08 00:51:42,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID
[2022-04-08 00:51:42,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID
[2022-04-08 00:51:42,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID
[2022-04-08 00:51:42,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {43#true} is VALID
[2022-04-08 00:51:42,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {43#true} is VALID
[2022-04-08 00:51:42,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [119] 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] {43#true} is VALID
[2022-04-08 00:51:42,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {44#false} is VALID
[2022-04-08 00:51:42,403 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {43#true} is VALID
[2022-04-08 00:51:42,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} [119] 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] {43#true} is VALID
[2022-04-08 00:51:42,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {44#false} is VALID
[2022-04-08 00:51:42,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID
[2022-04-08 00:51:42,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} [123] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,405 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID
[2022-04-08 00:51:42,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} [130] __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] {44#false} is VALID
[2022-04-08 00:51:42,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} [134] 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[] {44#false} is VALID
[2022-04-08 00:51:42,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID
[2022-04-08 00:51:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 00:51:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 00:51:42,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311269583]
[2022-04-08 00:51:42,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311269583] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 00:51:42,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 00:51:42,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 00:51:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303106921]
[2022-04-08 00:51:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 00:51:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-08 00:51:42,413 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 00:51:42,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:42,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:42,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 00:51:42,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 00:51:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 00:51:42,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 00:51:42,447 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:42,564 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions.
[2022-04-08 00:51:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 00:51:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-08 00:51:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 00:51:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2022-04-08 00:51:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2022-04-08 00:51:42,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions.
[2022-04-08 00:51:42,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:42,696 INFO L225 Difference]: With dead ends: 74
[2022-04-08 00:51:42,696 INFO L226 Difference]: Without dead ends: 36
[2022-04-08 00:51:42,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 00:51:42,704 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 00:51:42,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 00:51:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-08 00:51:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35.
[2022-04-08 00:51:42,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 00:51:42,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:42,740 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:42,741 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:42,747 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-08 00:51:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions.
[2022-04-08 00:51:42,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:42,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:42,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states.
[2022-04-08 00:51:42,750 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states.
[2022-04-08 00:51:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:42,754 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-08 00:51:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions.
[2022-04-08 00:51:42,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:42,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:42,756 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 00:51:42,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 00:51:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions.
[2022-04-08 00:51:42,760 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22
[2022-04-08 00:51:42,761 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 00:51:42,761 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions.
[2022-04-08 00:51:42,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions.
[2022-04-08 00:51:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 00:51:42,763 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 00:51:42,763 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:42,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 00:51:42,763 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 00:51:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 00:51:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times
[2022-04-08 00:51:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 00:51:42,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878853879]
[2022-04-08 00:51:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 00:51:42,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 00:51:42,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622339728]
[2022-04-08 00:51:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:42,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 00:51:42,811 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:51:42,833 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:51:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:42,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-08 00:51:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:42,915 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 00:51:43,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID
[2022-04-08 00:51:43,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#(<= ~counter~0 0)} {284#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= ~counter~0 0)} [119] 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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= ~counter~0 0)} [122] 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[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,137 INFO L272 TraceCheckUtils]: 11: Hoare triple {292#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#(<= ~counter~0 0)} [119] 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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= ~counter~0 0)} [122] 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[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {292#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:43,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {341#(<= |main_#t~post6| 0)} is VALID
[2022-04-08 00:51:43,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#(<= |main_#t~post6| 0)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {285#false} is VALID
[2022-04-08 00:51:43,144 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {285#false} is VALID
[2022-04-08 00:51:43,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#false} [130] __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] {285#false} is VALID
[2022-04-08 00:51:43,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#false} [134] 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[] {285#false} is VALID
[2022-04-08 00:51:43,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#false} is VALID
[2022-04-08 00:51:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 00:51:43,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 00:51:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 00:51:43,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878853879]
[2022-04-08 00:51:43,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 00:51:43,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622339728]
[2022-04-08 00:51:43,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622339728] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 00:51:43,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 00:51:43,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 00:51:43,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845118306]
[2022-04-08 00:51:43,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 00:51:43,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-08 00:51:43,151 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 00:51:43,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:43,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:43,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 00:51:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 00:51:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 00:51:43,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 00:51:43,167 INFO L87 Difference]: Start difference. First operand 35 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:43,302 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions.
[2022-04-08 00:51:43,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 00:51:43,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-08 00:51:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 00:51:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions.
[2022-04-08 00:51:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions.
[2022-04-08 00:51:43,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions.
[2022-04-08 00:51:43,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:43,361 INFO L225 Difference]: With dead ends: 44
[2022-04-08 00:51:43,361 INFO L226 Difference]: Without dead ends: 37
[2022-04-08 00:51:43,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 00:51:43,364 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 00:51:43,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 00:51:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2022-04-08 00:51:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2022-04-08 00:51:43,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 00:51:43,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:43,376 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:43,376 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:43,381 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions.
[2022-04-08 00:51:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions.
[2022-04-08 00:51:43,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:43,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:43,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states.
[2022-04-08 00:51:43,383 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states.
[2022-04-08 00:51:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:43,390 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions.
[2022-04-08 00:51:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions.
[2022-04-08 00:51:43,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:43,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:43,395 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 00:51:43,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 00:51:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions.
[2022-04-08 00:51:43,398 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23
[2022-04-08 00:51:43,398 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 00:51:43,398 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions.
[2022-04-08 00:51:43,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions.
[2022-04-08 00:51:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 00:51:43,398 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 00:51:43,399 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:43,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 00:51:43,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:43,617 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 00:51:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 00:51:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times
[2022-04-08 00:51:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 00:51:43,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340783947]
[2022-04-08 00:51:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 00:51:43,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 00:51:43,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785242957]
[2022-04-08 00:51:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:43,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 00:51:43,671 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:51:43,723 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:51:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:43,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 00:51:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:43,777 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 00:51:43,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID
[2022-04-08 00:51:43,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {547#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} [119] 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] {547#true} is VALID
[2022-04-08 00:51:43,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} [122] 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[] {547#true} is VALID
[2022-04-08 00:51:43,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID
[2022-04-08 00:51:43,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {547#true} {547#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {547#true} is VALID
[2022-04-08 00:51:43,875 INFO L272 TraceCheckUtils]: 11: Hoare triple {547#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {547#true} is VALID
[2022-04-08 00:51:43,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#true} [119] 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] {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-08 00:51:43,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-08 00:51:43,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-08 00:51:43,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {547#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {599#(<= 1 main_~y~0)} is VALID
[2022-04-08 00:51:43,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {603#(<= 1 main_~b~0)} is VALID
[2022-04-08 00:51:43,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {603#(<= 1 main_~b~0)} is VALID
[2022-04-08 00:51:43,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {603#(<= 1 main_~b~0)} is VALID
[2022-04-08 00:51:43,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {548#false} is VALID
[2022-04-08 00:51:43,878 INFO L272 TraceCheckUtils]: 20: Hoare triple {548#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {548#false} is VALID
[2022-04-08 00:51:43,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#false} [130] __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] {548#false} is VALID
[2022-04-08 00:51:43,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} [134] 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[] {548#false} is VALID
[2022-04-08 00:51:43,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#false} is VALID
[2022-04-08 00:51:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 00:51:43,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 00:51:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 00:51:43,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340783947]
[2022-04-08 00:51:43,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 00:51:43,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785242957]
[2022-04-08 00:51:43,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785242957] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 00:51:43,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 00:51:43,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 00:51:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069447061]
[2022-04-08 00:51:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 00:51:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24
[2022-04-08 00:51:43,880 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 00:51:43,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 00:51:43,899 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:51:43,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 00:51:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 00:51:43,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 00:51:43,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 00:51:43,900 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 00:51:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:44,101 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions.
[2022-04-08 00:51:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 00:51:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24
[2022-04-08 00:51:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 00:51:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 00:51:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-08 00:51:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 00:51:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-08 00:51:44,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions.
[2022-04-08 00:51:44,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:44,170 INFO L225 Difference]: With dead ends: 57
[2022-04-08 00:51:44,171 INFO L226 Difference]: Without dead ends: 50
[2022-04-08 00:51:44,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-08 00:51:44,171 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 00:51:44,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 00:51:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2022-04-08 00:51:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38.
[2022-04-08 00:51:44,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 00:51:44,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:44,188 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:44,188 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:44,190 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions.
[2022-04-08 00:51:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions.
[2022-04-08 00:51:44,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:44,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:44,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states.
[2022-04-08 00:51:44,191 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states.
[2022-04-08 00:51:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:44,193 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions.
[2022-04-08 00:51:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions.
[2022-04-08 00:51:44,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:44,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:44,193 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 00:51:44,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 00:51:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions.
[2022-04-08 00:51:44,195 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24
[2022-04-08 00:51:44,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 00:51:44,195 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions.
[2022-04-08 00:51:44,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 00:51:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions.
[2022-04-08 00:51:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 00:51:44,195 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 00:51:44,195 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:44,220 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:51:44,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 00:51:44,416 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 00:51:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 00:51:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times
[2022-04-08 00:51:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 00:51:44,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145199251]
[2022-04-08 00:51:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 00:51:44,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 00:51:44,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817673626]
[2022-04-08 00:51:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 00:51:44,503 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:51:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:44,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 00:51:44,588 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:51:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:44,597 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 00:51:44,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {865#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {865#true} is VALID
[2022-04-08 00:51:44,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(<= ~counter~0 0)} {865#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(<= ~counter~0 0)} [119] 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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= ~counter~0 0)} [122] 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[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {873#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~counter~0 0)} [119] 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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~counter~0 0)} [122] 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[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,756 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {873#(<= ~counter~0 0)} is VALID
[2022-04-08 00:51:44,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {922#(<= ~counter~0 1)} is VALID
[2022-04-08 00:51:44,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {922#(<= ~counter~0 1)} is VALID
[2022-04-08 00:51:44,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {922#(<= ~counter~0 1)} is VALID
[2022-04-08 00:51:44,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#(<= ~counter~0 1)} [137] L41-3-->L41-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] {932#(<= |main_#t~post7| 1)} is VALID
[2022-04-08 00:51:44,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |main_#t~post7| 1)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 2)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {866#false} is VALID
[2022-04-08 00:51:44,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {866#false} is VALID
[2022-04-08 00:51:44,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {866#false} is VALID
[2022-04-08 00:51:44,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {866#false} is VALID
[2022-04-08 00:51:44,760 INFO L272 TraceCheckUtils]: 25: Hoare triple {866#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {866#false} is VALID
[2022-04-08 00:51:44,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} [130] __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] {866#false} is VALID
[2022-04-08 00:51:44,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} [134] 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[] {866#false} is VALID
[2022-04-08 00:51:44,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#false} is VALID
[2022-04-08 00:51:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 00:51:44,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 00:51:44,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 00:51:44,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145199251]
[2022-04-08 00:51:44,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 00:51:44,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817673626]
[2022-04-08 00:51:44,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817673626] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 00:51:44,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 00:51:44,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 00:51:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698387659]
[2022-04-08 00:51:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 00:51:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29
[2022-04-08 00:51:44,763 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 00:51:44,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:44,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:44,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 00:51:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 00:51:44,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 00:51:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-08 00:51:44,794 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:45,096 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions.
[2022-04-08 00:51:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 00:51:45,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29
[2022-04-08 00:51:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 00:51:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2022-04-08 00:51:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2022-04-08 00:51:45,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions.
[2022-04-08 00:51:45,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:45,160 INFO L225 Difference]: With dead ends: 62
[2022-04-08 00:51:45,161 INFO L226 Difference]: Without dead ends: 40
[2022-04-08 00:51:45,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-08 00:51:45,163 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 00:51:45,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 00:51:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2022-04-08 00:51:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2022-04-08 00:51:45,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 00:51:45,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:45,184 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:45,184 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:45,189 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions.
[2022-04-08 00:51:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions.
[2022-04-08 00:51:45,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:45,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:45,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states.
[2022-04-08 00:51:45,191 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states.
[2022-04-08 00:51:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:45,194 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions.
[2022-04-08 00:51:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions.
[2022-04-08 00:51:45,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:45,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:45,194 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 00:51:45,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 00:51:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 00:51:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions.
[2022-04-08 00:51:45,203 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29
[2022-04-08 00:51:45,204 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 00:51:45,204 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions.
[2022-04-08 00:51:45,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions.
[2022-04-08 00:51:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 00:51:45,204 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 00:51:45,204 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:45,222 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:51:45,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:45,406 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 00:51:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 00:51:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times
[2022-04-08 00:51:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 00:51:45,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51042875]
[2022-04-08 00:51:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 00:51:45,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 00:51:45,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109771515]
[2022-04-08 00:51:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:45,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:45,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 00:51:45,448 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:51:45,480 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:51:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:45,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-08 00:51:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 00:51:45,549 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 00:51:45,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID
[2022-04-08 00:51:45,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#(<= 0 ~counter~0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#(<= 0 ~counter~0)} {1183#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#(<= 0 ~counter~0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(<= 0 ~counter~0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#(<= 0 ~counter~0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= 0 ~counter~0)} [119] 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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {1191#(<= 0 ~counter~0)} [122] 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[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(<= 0 ~counter~0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,729 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1191#(<= 0 ~counter~0)} {1191#(<= 0 ~counter~0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {1191#(<= 0 ~counter~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(<= 0 ~counter~0)} [119] 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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(<= 0 ~counter~0)} [122] 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[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(<= 0 ~counter~0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,731 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1191#(<= 0 ~counter~0)} {1191#(<= 0 ~counter~0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= 0 ~counter~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1191#(<= 0 ~counter~0)} is VALID
[2022-04-08 00:51:45,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= 0 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1240#(<= 1 ~counter~0)} is VALID
[2022-04-08 00:51:45,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(<= 1 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1240#(<= 1 ~counter~0)} is VALID
[2022-04-08 00:51:45,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {1240#(<= 1 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1240#(<= 1 ~counter~0)} is VALID
[2022-04-08 00:51:45,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(<= 1 ~counter~0)} [137] L41-3-->L41-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] {1250#(<= 2 ~counter~0)} is VALID
[2022-04-08 00:51:45,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {1250#(<= 2 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1250#(<= 2 ~counter~0)} is VALID
[2022-04-08 00:51:45,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 2 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {1250#(<= 2 ~counter~0)} is VALID
[2022-04-08 00:51:45,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {1250#(<= 2 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {1260#(<= 2 |main_#t~post8|)} is VALID
[2022-04-08 00:51:45,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {1260#(<= 2 |main_#t~post8|)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 2) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1184#false} is VALID
[2022-04-08 00:51:45,735 INFO L272 TraceCheckUtils]: 25: Hoare triple {1184#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1184#false} is VALID
[2022-04-08 00:51:45,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {1184#false} [130] __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] {1184#false} is VALID
[2022-04-08 00:51:45,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {1184#false} [134] 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[] {1184#false} is VALID
[2022-04-08 00:51:45,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {1184#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1184#false} is VALID
[2022-04-08 00:51:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 00:51:45,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 00:51:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 00:51:45,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51042875]
[2022-04-08 00:51:45,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 00:51:45,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109771515]
[2022-04-08 00:51:45,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109771515] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 00:51:45,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 00:51:45,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 00:51:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333192115]
[2022-04-08 00:51:45,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 00:51:45,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29
[2022-04-08 00:51:45,737 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 00:51:45,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:45,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 00:51:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 00:51:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 00:51:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2022-04-08 00:51:45,754 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:45,881 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions.
[2022-04-08 00:51:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 00:51:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29
[2022-04-08 00:51:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 00:51:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions.
[2022-04-08 00:51:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions.
[2022-04-08 00:51:45,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions.
[2022-04-08 00:51:45,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 00:51:45,931 INFO L225 Difference]: With dead ends: 57
[2022-04-08 00:51:45,931 INFO L226 Difference]: Without dead ends: 33
[2022-04-08 00:51:45,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2022-04-08 00:51:45,932 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 00:51:45,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 00:51:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2022-04-08 00:51:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2022-04-08 00:51:45,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 00:51:45,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 00:51:45,957 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 00:51:45,957 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 00:51:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:45,958 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions.
[2022-04-08 00:51:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2022-04-08 00:51:45,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:45,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:45,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states.
[2022-04-08 00:51:45,958 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states.
[2022-04-08 00:51:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 00:51:45,959 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions.
[2022-04-08 00:51:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2022-04-08 00:51:45,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 00:51:45,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 00:51:45,959 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 00:51:45,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 00:51:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 00:51:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions.
[2022-04-08 00:51:45,960 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 29
[2022-04-08 00:51:45,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 00:51:45,961 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions.
[2022-04-08 00:51:45,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 00:51:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2022-04-08 00:51:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 00:51:45,961 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 00:51:45,961 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:45,989 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:51:46,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:46,187 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 00:51:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 00:51:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times
[2022-04-08 00:51:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 00:51:46,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456481660]
[2022-04-08 00:51:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 00:51:46,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 00:51:46,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654422116]
[2022-04-08 00:51:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 00:51:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:46,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 00:51:46,227 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:51:46,261 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:51:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-08 00:51:46,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-08 00:51:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-08 00:51:46,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-08 00:51:46,357 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-08 00:51:46,358 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 00:51:46,441 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:51:46,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 00:51:46,561 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2022-04-08 00:51:46,563 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 00:51:46,582 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 00:51:46,582 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-08 00:51:46,582 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-08 00:51:46,582 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-08 00:51:46,582 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation
[2022-04-08 00:51:46,583 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation
[2022-04-08 00:51:46,584 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation
[2022-04-08 00:51:46,584 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:51:46,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:51:46 BasicIcfg
[2022-04-08 00:51:46,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 00:51:46,586 INFO L158 Benchmark]: Toolchain (without parser) took 4919.26ms. Allocated memory was 177.2MB in the beginning and 221.2MB in the end (delta: 44.0MB). Free memory was 152.7MB in the beginning and 116.9MB in the end (delta: 35.8MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB.
[2022-04-08 00:51:46,586 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory was 138.0MB in the beginning and 137.8MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 00:51:46,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.61ms. Allocated memory is still 177.2MB. Free memory was 152.4MB in the beginning and 149.5MB in the end (delta: 2.9MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB.
[2022-04-08 00:51:46,586 INFO L158 Benchmark]: Boogie Preprocessor took 18.80ms. Allocated memory is still 177.2MB. Free memory was 149.5MB in the beginning and 147.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 00:51:46,586 INFO L158 Benchmark]: RCFGBuilder took 214.68ms. Allocated memory is still 177.2MB. Free memory was 147.6MB in the beginning and 134.5MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2022-04-08 00:51:46,587 INFO L158 Benchmark]: IcfgTransformer took 45.92ms. Allocated memory is still 177.2MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 00:51:46,604 INFO L158 Benchmark]: TraceAbstraction took 4400.13ms. Allocated memory was 177.2MB in the beginning and 221.2MB in the end (delta: 44.0MB). Free memory was 132.0MB in the beginning and 116.9MB in the end (delta: 15.1MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB.
[2022-04-08 00:51:46,615 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.09ms. Allocated memory is still 177.2MB. Free memory was 138.0MB in the beginning and 137.8MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 223.61ms. Allocated memory is still 177.2MB. Free memory was 152.4MB in the beginning and 149.5MB in the end (delta: 2.9MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 18.80ms. Allocated memory is still 177.2MB. Free memory was 149.5MB in the beginning and 147.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 214.68ms. Allocated memory is still 177.2MB. Free memory was 147.6MB in the beginning and 134.5MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
* IcfgTransformer took 45.92ms. Allocated memory is still 177.2MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* TraceAbstraction took 4400.13ms. Allocated memory was 177.2MB in the beginning and 221.2MB in the end (delta: 44.0MB). Free memory was 132.0MB in the beginning and 116.9MB in the end (delta: 15.1MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 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;
[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=4]
[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=4]
[L27] a = x
[L28] b = y
[L29] p = 1
[L30] q = 0
[L31] r = 0
[L32] s = 1
VAL [\old(counter)=0, a=1, b=4, counter=0, p=1, q=0, r=0, s=1, x=1, y=4]
[L34] EXPR counter++
VAL [\old(counter)=0, a=1, b=4, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=1, y=4]
[L34] COND TRUE counter++<2
[L35] COND FALSE !(!(b != 0))
[L37] long long c, k;
[L38] c = a
[L39] k = 0
VAL [\old(counter)=0, a=1, b=4, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, y=4]
[L41] EXPR counter++
VAL [\old(counter)=0, a=1, b=4, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, y=4]
[L41] COND TRUE counter++<2
[L42] COND TRUE !(c >= b)
VAL [\old(counter)=0, a=1, b=4, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, y=4]
[L63] a = b
[L64] b = c
[L65] long long temp;
[L66] temp = p
[L67] p = q
[L68] q = temp - q * k
[L69] temp = r
[L70] r = s
[L71] s = temp - s * k
VAL [\old(counter)=0, a=4, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, y=4]
[L34] EXPR counter++
VAL [\old(counter)=0, a=4, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, y=4]
[L34] COND FALSE !(counter++<2)
[L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a)
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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 325 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 205 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 8 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 22/22 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:51:46,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...