/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-dev-e106359-m
[2022-04-14 22:49:05,766 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-04-14 22:49:05,767 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-14 22:49:05,801 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-14 22:49:05,802 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-14 22:49:05,803 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-14 22:49:05,808 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-14 22:49:05,814 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-14 22:49:05,815 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-14 22:49:05,815 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-14 22:49:05,816 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-04-14 22:49:05,817 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-14 22:49:05,817 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-14 22:49:05,818 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-14 22:49:05,819 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-14 22:49:05,819 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-14 22:49:05,820 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-14 22:49:05,821 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-14 22:49:05,822 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-14 22:49:05,825 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-14 22:49:05,828 INFO  L181        SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-14 22:49:05,831 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-14 22:49:05,832 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-14 22:49:05,833 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-04-14 22:49:05,835 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-14 22:49:05,841 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-14 22:49:05,842 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-14 22:49:05,842 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-14 22:49:05,843 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-14 22:49:05,843 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-14 22:49:05,844 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-14 22:49:05,845 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-14 22:49:05,846 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-14 22:49:05,846 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-14 22:49:05,847 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-14 22:49:05,848 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-14 22:49:05,848 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-14 22:49:05,848 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-14 22:49:05,849 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-14 22:49:05,849 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-14 22:49:05,849 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-14 22:49:05,852 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-04-14 22:49:05,852 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-14 22:49:05,865 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-04-14 22:49:05,865 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-14 22:49:05,866 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-14 22:49:05,866 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-04-14 22:49:05,866 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-04-14 22:49:05,867 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-04-14 22:49:05,867 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-04-14 22:49:05,867 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-04-14 22:49:05,867 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-04-14 22:49:05,868 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-04-14 22:49:05,868 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-04-14 22:49:05,869 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 22:49:05,869 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-14 22:49:05,869 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-04-14 22:49:05,869 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-14 22:49:05,869 INFO  L138        SettingsManager]:  * TransformationType=LOOP_ACCELERATION_JORDAN
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-14 22:49:06,110 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-14 22:49:06,131 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-14 22:49:06,133 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-14 22:49:06,134 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-04-14 22:49:06,135 INFO  L275        PluginConnector]: CDTParser initialized
[2022-04-14 22:49:06,136 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c
[2022-04-14 22:49:06,190 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97729048f/23be7eedb0e64b54b980000616d39e48/FLAG99c177d21
[2022-04-14 22:49:06,523 INFO  L306              CDTParser]: Found 1 translation units.
[2022-04-14 22:49:06,523 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c
[2022-04-14 22:49:06,529 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97729048f/23be7eedb0e64b54b980000616d39e48/FLAG99c177d21
[2022-04-14 22:49:06,954 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97729048f/23be7eedb0e64b54b980000616d39e48
[2022-04-14 22:49:06,956 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-14 22:49:06,957 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-14 22:49:06,963 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-14 22:49:06,964 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-14 22:49:06,968 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-14 22:49:06,969 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:49:06" (1/1) ...
[2022-04-14 22:49:06,970 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfa3712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:06, skipping insertion in model container
[2022-04-14 22:49:06,970 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:49:06" (1/1) ...
[2022-04-14 22:49:06,976 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-04-14 22:49:06,989 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-04-14 22:49:07,115 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/prodbin-ll_valuebound100.c[537,550]
[2022-04-14 22:49:07,128 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-04-14 22:49:07,146 INFO  L203         MainTranslator]: Completed pre-run
[2022-04-14 22:49:07,158 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/prodbin-ll_valuebound100.c[537,550]
[2022-04-14 22:49:07,175 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-04-14 22:49:07,190 INFO  L208         MainTranslator]: Completed translation
[2022-04-14 22:49:07,190 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07 WrapperNode
[2022-04-14 22:49:07,190 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-14 22:49:07,191 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-14 22:49:07,191 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-14 22:49:07,192 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-04-14 22:49:07,203 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,204 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,212 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,212 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,230 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,235 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,238 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,243 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-14 22:49:07,244 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-14 22:49:07,244 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-04-14 22:49:07,244 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-04-14 22:49:07,246 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,257 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 22:49:07,267 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:49:07,280 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-14 22:49:07,295 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-14 22:49:07,322 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-14 22:49:07,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-14 22:49:07,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-14 22:49:07,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-14 22:49:07,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-14 22:49:07,324 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2022-04-14 22:49:07,324 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2022-04-14 22:49:07,324 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-14 22:49:07,324 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-14 22:49:07,324 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-14 22:49:07,324 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-14 22:49:07,325 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-14 22:49:07,325 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-14 22:49:07,325 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2022-04-14 22:49:07,326 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-14 22:49:07,326 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-14 22:49:07,326 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-14 22:49:07,326 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-04-14 22:49:07,327 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-04-14 22:49:07,327 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-14 22:49:07,388 INFO  L234             CfgBuilder]: Building ICFG
[2022-04-14 22:49:07,390 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-14 22:49:07,560 INFO  L275             CfgBuilder]: Performing block encoding
[2022-04-14 22:49:07,567 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-14 22:49:07,567 INFO  L299             CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-14 22:49:07,569 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:49:07 BoogieIcfgContainer
[2022-04-14 22:49:07,569 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-14 22:49:07,570 INFO  L113        PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-14 22:49:07,570 INFO  L271        PluginConnector]: Initializing IcfgTransformer...
[2022-04-14 22:49:07,571 INFO  L275        PluginConnector]: IcfgTransformer initialized
[2022-04-14 22:49:07,573 INFO  L185        PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:49:07" (1/1) ...
[2022-04-14 22:49:07,575 INFO  L168   ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-14 22:49:07,600 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:49:07 BasicIcfg
[2022-04-14 22:49:07,601 INFO  L132        PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-14 22:49:07,602 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-14 22:49:07,602 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-04-14 22:49:07,605 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-04-14 22:49:07,605 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:49:06" (1/4) ...
[2022-04-14 22:49:07,605 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35390a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:49:07, skipping insertion in model container
[2022-04-14 22:49:07,605 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:49:07" (2/4) ...
[2022-04-14 22:49:07,606 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35390a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:49:07, skipping insertion in model container
[2022-04-14 22:49:07,606 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:49:07" (3/4) ...
[2022-04-14 22:49:07,606 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35390a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:49:07, skipping insertion in model container
[2022-04-14 22:49:07,606 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:49:07" (4/4) ...
[2022-04-14 22:49:07,607 INFO  L111   eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.cJordan
[2022-04-14 22:49:07,611 INFO  L202   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-14 22:49:07,611 INFO  L161   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-14 22:49:07,643 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-14 22:49:07,648 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-14 22:49:07,648 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-14 22:49:07,662 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-14 22:49:07,669 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-14 22:49:07,669 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:49:07,669 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:49:07,670 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:49:07,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:49:07,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 1656134296, now seen corresponding path program 1 times
[2022-04-14 22:49:07,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:49:07,681 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906194080]
[2022-04-14 22:49:07,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:07,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:49:07,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:07,845 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 22:49:07,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:07,868 INFO  L290        TraceCheckUtils]: 0: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID
[2022-04-14 22:49:07,868 INFO  L290        TraceCheckUtils]: 1: Hoare triple {35#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {35#true} is VALID
[2022-04-14 22:49:07,868 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {35#true} is VALID
[2022-04-14 22:49:07,869 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-14 22:49:07,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:07,881 INFO  L290        TraceCheckUtils]: 0: Hoare triple {35#true} [82] assume_abort_if_notENTRY-->L10: 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] {35#true} is VALID
[2022-04-14 22:49:07,882 INFO  L290        TraceCheckUtils]: 1: Hoare triple {35#true} [84] L10-->L10-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,883 INFO  L290        TraceCheckUtils]: 2: Hoare triple {36#false} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,883 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID
[2022-04-14 22:49:07,885 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-14 22:49:07,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:07,903 INFO  L290        TraceCheckUtils]: 0: Hoare triple {35#true} [82] assume_abort_if_notENTRY-->L10: 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] {35#true} is VALID
[2022-04-14 22:49:07,904 INFO  L290        TraceCheckUtils]: 1: Hoare triple {35#true} [84] L10-->L10-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,904 INFO  L290        TraceCheckUtils]: 2: Hoare triple {36#false} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,905 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-14 22:49:07,905 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2022-04-14 22:49:07,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:07,925 INFO  L290        TraceCheckUtils]: 0: Hoare triple {35#true} [82] assume_abort_if_notENTRY-->L10: 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] {35#true} is VALID
[2022-04-14 22:49:07,925 INFO  L290        TraceCheckUtils]: 1: Hoare triple {35#true} [84] L10-->L10-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,926 INFO  L290        TraceCheckUtils]: 2: Hoare triple {36#false} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,927 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-14 22:49:07,928 INFO  L272        TraceCheckUtils]: 0: Hoare triple {35#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 22:49:07,930 INFO  L290        TraceCheckUtils]: 1: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID
[2022-04-14 22:49:07,930 INFO  L290        TraceCheckUtils]: 2: Hoare triple {35#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {35#true} is VALID
[2022-04-14 22:49:07,932 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {35#true} is VALID
[2022-04-14 22:49:07,932 INFO  L272        TraceCheckUtils]: 4: Hoare triple {35#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {35#true} is VALID
[2022-04-14 22:49:07,932 INFO  L290        TraceCheckUtils]: 5: Hoare triple {35#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {35#true} is VALID
[2022-04-14 22:49:07,932 INFO  L272        TraceCheckUtils]: 6: Hoare triple {35#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#true} is VALID
[2022-04-14 22:49:07,933 INFO  L290        TraceCheckUtils]: 7: Hoare triple {35#true} [82] assume_abort_if_notENTRY-->L10: 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] {35#true} is VALID
[2022-04-14 22:49:07,934 INFO  L290        TraceCheckUtils]: 8: Hoare triple {35#true} [84] L10-->L10-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,934 INFO  L290        TraceCheckUtils]: 9: Hoare triple {36#false} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,934 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {36#false} is VALID
[2022-04-14 22:49:07,935 INFO  L290        TraceCheckUtils]: 11: Hoare triple {36#false} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {36#false} is VALID
[2022-04-14 22:49:07,935 INFO  L272        TraceCheckUtils]: 12: Hoare triple {36#false} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#true} is VALID
[2022-04-14 22:49:07,935 INFO  L290        TraceCheckUtils]: 13: Hoare triple {35#true} [82] assume_abort_if_notENTRY-->L10: 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] {35#true} is VALID
[2022-04-14 22:49:07,936 INFO  L290        TraceCheckUtils]: 14: Hoare triple {35#true} [84] L10-->L10-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,936 INFO  L290        TraceCheckUtils]: 15: Hoare triple {36#false} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,936 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-14 22:49:07,937 INFO  L272        TraceCheckUtils]: 17: Hoare triple {36#false} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#true} is VALID
[2022-04-14 22:49:07,937 INFO  L290        TraceCheckUtils]: 18: Hoare triple {35#true} [82] assume_abort_if_notENTRY-->L10: 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] {35#true} is VALID
[2022-04-14 22:49:07,938 INFO  L290        TraceCheckUtils]: 19: Hoare triple {35#true} [84] L10-->L10-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,938 INFO  L290        TraceCheckUtils]: 20: Hoare triple {36#false} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,939 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-14 22:49:07,939 INFO  L290        TraceCheckUtils]: 22: Hoare triple {36#false} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {36#false} is VALID
[2022-04-14 22:49:07,939 INFO  L290        TraceCheckUtils]: 23: Hoare triple {36#false} [89] L34-2-->L34-3: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,940 INFO  L272        TraceCheckUtils]: 24: Hoare triple {36#false} [92] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_8 (* v_main_~a~0_10 v_main_~b~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~b~0=v_main_~b~0_11, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_10}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~b~0, main_~a~0] {36#false} is VALID
[2022-04-14 22:49:07,940 INFO  L290        TraceCheckUtils]: 25: Hoare triple {36#false} [95] __VERIFIER_assertENTRY-->L13: 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] {36#false} is VALID
[2022-04-14 22:49:07,941 INFO  L290        TraceCheckUtils]: 26: Hoare triple {36#false} [99] L13-->L14: 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[] {36#false} is VALID
[2022-04-14 22:49:07,942 INFO  L290        TraceCheckUtils]: 27: Hoare triple {36#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {36#false} is VALID
[2022-04-14 22:49:07,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-14 22:49:07,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:49:07,943 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906194080]
[2022-04-14 22:49:07,944 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906194080] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 22:49:07,944 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 22:49:07,944 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-14 22:49:07,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456229737]
[2022-04-14 22:49:07,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 22:49:07,953 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28
[2022-04-14 22:49:07,954 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:49:07,957 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-14 22:49:07,996 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:07,997 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-14 22:49:07,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:49:08,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-14 22:49:08,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-14 22:49:08,024 INFO  L87              Difference]: Start difference. First operand  has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-14 22:49:08,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:08,156 INFO  L93              Difference]: Finished difference Result 32 states and 36 transitions.
[2022-04-14 22:49:08,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-04-14 22:49:08,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28
[2022-04-14 22:49:08,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:49:08,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-14 22:49:08,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions.
[2022-04-14 22:49:08,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-14 22:49:08,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions.
[2022-04-14 22:49:08,179 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions.
[2022-04-14 22:49:08,240 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:08,251 INFO  L225             Difference]: With dead ends: 32
[2022-04-14 22:49:08,252 INFO  L226             Difference]: Without dead ends: 27
[2022-04-14 22:49:08,258 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 22:49:08,263 INFO  L913         BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-14 22:49:08,264 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-14 22:49:08,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-14 22:49:08,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-14 22:49:08,292 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:49:08,293 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand  has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:49:08,294 INFO  L74              IsIncluded]: Start isIncluded. First operand 27 states. Second operand  has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:49:08,294 INFO  L87              Difference]: Start difference. First operand 27 states. Second operand  has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:49:08,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:08,301 INFO  L93              Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-14 22:49:08,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-14 22:49:08,302 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:08,302 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:08,303 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states.
[2022-04-14 22:49:08,303 INFO  L87              Difference]: Start difference. First operand  has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states.
[2022-04-14 22:49:08,308 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:08,308 INFO  L93              Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-14 22:49:08,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-14 22:49:08,308 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:08,308 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:08,308 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:49:08,309 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:49:08,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:49:08,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions.
[2022-04-14 22:49:08,312 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28
[2022-04-14 22:49:08,312 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:49:08,312 INFO  L478      AbstractCegarLoop]: Abstraction has 27 states and 31 transitions.
[2022-04-14 22:49:08,313 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-14 22:49:08,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-14 22:49:08,314 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-14 22:49:08,314 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:49:08,324 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:49:08,325 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-14 22:49:08,325 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:49:08,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:49:08,326 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063826184, now seen corresponding path program 1 times
[2022-04-14 22:49:08,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:49:08,326 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341514733]
[2022-04-14 22:49:08,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:08,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:49:08,366 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:49:08,367 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083187685]
[2022-04-14 22:49:08,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:08,368 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:49:08,368 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:49:08,375 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-14 22:49:08,379 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-14 22:49:08,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:08,464 INFO  L263         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-14 22:49:08,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:08,482 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:49:08,661 INFO  L272        TraceCheckUtils]: 0: Hoare triple {168#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,661 INFO  L290        TraceCheckUtils]: 1: Hoare triple {168#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {168#true} is VALID
[2022-04-14 22:49:08,661 INFO  L290        TraceCheckUtils]: 2: Hoare triple {168#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,662 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,662 INFO  L272        TraceCheckUtils]: 4: Hoare triple {168#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,662 INFO  L290        TraceCheckUtils]: 5: Hoare triple {168#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {168#true} is VALID
[2022-04-14 22:49:08,662 INFO  L272        TraceCheckUtils]: 6: Hoare triple {168#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {168#true} is VALID
[2022-04-14 22:49:08,663 INFO  L290        TraceCheckUtils]: 7: Hoare triple {168#true} [82] assume_abort_if_notENTRY-->L10: 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] {168#true} is VALID
[2022-04-14 22:49:08,663 INFO  L290        TraceCheckUtils]: 8: Hoare triple {168#true} [85] L10-->L10-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[] {168#true} is VALID
[2022-04-14 22:49:08,663 INFO  L290        TraceCheckUtils]: 9: Hoare triple {168#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,663 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {168#true} {168#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {168#true} is VALID
[2022-04-14 22:49:08,664 INFO  L290        TraceCheckUtils]: 11: Hoare triple {168#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {168#true} is VALID
[2022-04-14 22:49:08,664 INFO  L272        TraceCheckUtils]: 12: Hoare triple {168#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {168#true} is VALID
[2022-04-14 22:49:08,664 INFO  L290        TraceCheckUtils]: 13: Hoare triple {168#true} [82] assume_abort_if_notENTRY-->L10: 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] {168#true} is VALID
[2022-04-14 22:49:08,664 INFO  L290        TraceCheckUtils]: 14: Hoare triple {168#true} [85] L10-->L10-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[] {168#true} is VALID
[2022-04-14 22:49:08,665 INFO  L290        TraceCheckUtils]: 15: Hoare triple {168#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,665 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {168#true} {168#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {168#true} is VALID
[2022-04-14 22:49:08,665 INFO  L272        TraceCheckUtils]: 17: Hoare triple {168#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {168#true} is VALID
[2022-04-14 22:49:08,665 INFO  L290        TraceCheckUtils]: 18: Hoare triple {168#true} [82] assume_abort_if_notENTRY-->L10: 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] {168#true} is VALID
[2022-04-14 22:49:08,666 INFO  L290        TraceCheckUtils]: 19: Hoare triple {168#true} [85] L10-->L10-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[] {168#true} is VALID
[2022-04-14 22:49:08,666 INFO  L290        TraceCheckUtils]: 20: Hoare triple {168#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {168#true} is VALID
[2022-04-14 22:49:08,666 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {168#true} {168#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {168#true} is VALID
[2022-04-14 22:49:08,667 INFO  L290        TraceCheckUtils]: 22: Hoare triple {168#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {239#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:08,668 INFO  L290        TraceCheckUtils]: 23: Hoare triple {239#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {239#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:08,669 INFO  L272        TraceCheckUtils]: 24: Hoare triple {239#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {246#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:49:08,669 INFO  L290        TraceCheckUtils]: 25: Hoare triple {246#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {250#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:49:08,670 INFO  L290        TraceCheckUtils]: 26: Hoare triple {250#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {169#false} is VALID
[2022-04-14 22:49:08,670 INFO  L290        TraceCheckUtils]: 27: Hoare triple {169#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {169#false} is VALID
[2022-04-14 22:49:08,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-14 22:49:08,671 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-14 22:49:08,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:49:08,671 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341514733]
[2022-04-14 22:49:08,671 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:49:08,671 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083187685]
[2022-04-14 22:49:08,672 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083187685] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 22:49:08,672 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 22:49:08,672 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-14 22:49:08,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827149036]
[2022-04-14 22:49:08,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 22:49:08,674 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28
[2022-04-14 22:49:08,674 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:49:08,674 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-14 22:49:08,693 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:08,694 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-14 22:49:08,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:49:08,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-14 22:49:08,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-14 22:49:08,695 INFO  L87              Difference]: Start difference. First operand 27 states and 31 transitions. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-14 22:49:08,829 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:08,829 INFO  L93              Difference]: Finished difference Result 37 states and 43 transitions.
[2022-04-14 22:49:08,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-04-14 22:49:08,829 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28
[2022-04-14 22:49:08,830 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:49:08,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-14 22:49:08,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions.
[2022-04-14 22:49:08,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-14 22:49:08,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions.
[2022-04-14 22:49:08,834 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions.
[2022-04-14 22:49:08,871 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:08,873 INFO  L225             Difference]: With dead ends: 37
[2022-04-14 22:49:08,873 INFO  L226             Difference]: Without dead ends: 37
[2022-04-14 22:49:08,873 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-14 22:49:08,874 INFO  L913         BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-14 22:49:08,875 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-14 22:49:08,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2022-04-14 22:49:08,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33.
[2022-04-14 22:49:08,879 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:49:08,879 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand  has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:08,879 INFO  L74              IsIncluded]: Start isIncluded. First operand 37 states. Second operand  has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:08,880 INFO  L87              Difference]: Start difference. First operand 37 states. Second operand  has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:08,882 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:08,883 INFO  L93              Difference]: Finished difference Result 37 states and 43 transitions.
[2022-04-14 22:49:08,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions.
[2022-04-14 22:49:08,883 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:08,883 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:08,884 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states.
[2022-04-14 22:49:08,884 INFO  L87              Difference]: Start difference. First operand  has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states.
[2022-04-14 22:49:08,887 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:08,887 INFO  L93              Difference]: Finished difference Result 37 states and 43 transitions.
[2022-04-14 22:49:08,887 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions.
[2022-04-14 22:49:08,888 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:08,888 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:08,888 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:49:08,888 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:49:08,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:08,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions.
[2022-04-14 22:49:08,890 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28
[2022-04-14 22:49:08,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:49:08,890 INFO  L478      AbstractCegarLoop]: Abstraction has 33 states and 37 transitions.
[2022-04-14 22:49:08,891 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2022-04-14 22:49:08,891 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2022-04-14 22:49:08,892 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-14 22:49:08,892 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:49:08,892 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 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-14 22:49:08,922 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-14 22:49:09,113 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-14 22:49:09,114 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:49:09,114 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:49:09,114 INFO  L85        PathProgramCache]: Analyzing trace with hash -499634320, now seen corresponding path program 1 times
[2022-04-14 22:49:09,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:49:09,115 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895320459]
[2022-04-14 22:49:09,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:09,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:49:09,138 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:49:09,139 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36193526]
[2022-04-14 22:49:09,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:09,139 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:49:09,139 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:49:09,143 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-14 22:49:09,145 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-14 22:49:09,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:09,194 INFO  L263         TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-14 22:49:09,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:09,204 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:49:09,340 INFO  L272        TraceCheckUtils]: 0: Hoare triple {402#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,340 INFO  L290        TraceCheckUtils]: 1: Hoare triple {402#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {402#true} is VALID
[2022-04-14 22:49:09,341 INFO  L290        TraceCheckUtils]: 2: Hoare triple {402#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,341 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {402#true} {402#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,341 INFO  L272        TraceCheckUtils]: 4: Hoare triple {402#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,342 INFO  L290        TraceCheckUtils]: 5: Hoare triple {402#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {402#true} is VALID
[2022-04-14 22:49:09,342 INFO  L272        TraceCheckUtils]: 6: Hoare triple {402#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {402#true} is VALID
[2022-04-14 22:49:09,342 INFO  L290        TraceCheckUtils]: 7: Hoare triple {402#true} [82] assume_abort_if_notENTRY-->L10: 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] {402#true} is VALID
[2022-04-14 22:49:09,342 INFO  L290        TraceCheckUtils]: 8: Hoare triple {402#true} [85] L10-->L10-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[] {402#true} is VALID
[2022-04-14 22:49:09,342 INFO  L290        TraceCheckUtils]: 9: Hoare triple {402#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,343 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {402#true} {402#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {402#true} is VALID
[2022-04-14 22:49:09,343 INFO  L290        TraceCheckUtils]: 11: Hoare triple {402#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {402#true} is VALID
[2022-04-14 22:49:09,343 INFO  L272        TraceCheckUtils]: 12: Hoare triple {402#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {402#true} is VALID
[2022-04-14 22:49:09,343 INFO  L290        TraceCheckUtils]: 13: Hoare triple {402#true} [82] assume_abort_if_notENTRY-->L10: 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] {402#true} is VALID
[2022-04-14 22:49:09,343 INFO  L290        TraceCheckUtils]: 14: Hoare triple {402#true} [85] L10-->L10-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[] {402#true} is VALID
[2022-04-14 22:49:09,344 INFO  L290        TraceCheckUtils]: 15: Hoare triple {402#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,345 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {402#true} {402#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {402#true} is VALID
[2022-04-14 22:49:09,346 INFO  L272        TraceCheckUtils]: 17: Hoare triple {402#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {402#true} is VALID
[2022-04-14 22:49:09,346 INFO  L290        TraceCheckUtils]: 18: Hoare triple {402#true} [82] assume_abort_if_notENTRY-->L10: 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] {461#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-14 22:49:09,347 INFO  L290        TraceCheckUtils]: 19: Hoare triple {461#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [85] L10-->L10-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[] {465#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:49:09,347 INFO  L290        TraceCheckUtils]: 20: Hoare triple {465#(not (= |assume_abort_if_not_#in~cond| 0))} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {465#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:49:09,348 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {465#(not (= |assume_abort_if_not_#in~cond| 0))} {402#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {472#(<= 1 main_~b~0)} is VALID
[2022-04-14 22:49:09,348 INFO  L290        TraceCheckUtils]: 22: Hoare triple {472#(<= 1 main_~b~0)} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {476#(<= 1 main_~y~0)} is VALID
[2022-04-14 22:49:09,349 INFO  L290        TraceCheckUtils]: 23: Hoare triple {476#(<= 1 main_~y~0)} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {476#(<= 1 main_~y~0)} is VALID
[2022-04-14 22:49:09,349 INFO  L272        TraceCheckUtils]: 24: Hoare triple {476#(<= 1 main_~y~0)} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {402#true} is VALID
[2022-04-14 22:49:09,349 INFO  L290        TraceCheckUtils]: 25: Hoare triple {402#true} [95] __VERIFIER_assertENTRY-->L13: 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] {402#true} is VALID
[2022-04-14 22:49:09,349 INFO  L290        TraceCheckUtils]: 26: Hoare triple {402#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,349 INFO  L290        TraceCheckUtils]: 27: Hoare triple {402#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {402#true} is VALID
[2022-04-14 22:49:09,350 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {402#true} {476#(<= 1 main_~y~0)} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {476#(<= 1 main_~y~0)} is VALID
[2022-04-14 22:49:09,353 INFO  L290        TraceCheckUtils]: 29: Hoare triple {476#(<= 1 main_~y~0)} [96] L35-1-->L34-3: Formula: (= v_main_~y~0_9 0)  InVars {main_~y~0=v_main_~y~0_9}  OutVars{main_~y~0=v_main_~y~0_9}  AuxVars[]  AssignedVars[] {403#false} is VALID
[2022-04-14 22:49:09,353 INFO  L272        TraceCheckUtils]: 30: Hoare triple {403#false} [92] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_8 (* v_main_~a~0_10 v_main_~b~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~b~0=v_main_~b~0_11, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_10}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~b~0, main_~a~0] {403#false} is VALID
[2022-04-14 22:49:09,353 INFO  L290        TraceCheckUtils]: 31: Hoare triple {403#false} [95] __VERIFIER_assertENTRY-->L13: 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] {403#false} is VALID
[2022-04-14 22:49:09,353 INFO  L290        TraceCheckUtils]: 32: Hoare triple {403#false} [99] L13-->L14: 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[] {403#false} is VALID
[2022-04-14 22:49:09,354 INFO  L290        TraceCheckUtils]: 33: Hoare triple {403#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {403#false} is VALID
[2022-04-14 22:49:09,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-14 22:49:09,355 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-14 22:49:09,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:49:09,357 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895320459]
[2022-04-14 22:49:09,357 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:49:09,358 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36193526]
[2022-04-14 22:49:09,358 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [36193526] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 22:49:09,358 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 22:49:09,358 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-14 22:49:09,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340482276]
[2022-04-14 22:49:09,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 22:49:09,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34
[2022-04-14 22:49:09,359 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:49:09,359 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:09,383 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:09,383 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-14 22:49:09,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:49:09,384 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-14 22:49:09,384 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-14 22:49:09,384 INFO  L87              Difference]: Start difference. First operand 33 states and 37 transitions. Second operand  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:09,564 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:09,564 INFO  L93              Difference]: Finished difference Result 36 states and 41 transitions.
[2022-04-14 22:49:09,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-04-14 22:49:09,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34
[2022-04-14 22:49:09,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:49:09,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:09,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions.
[2022-04-14 22:49:09,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:09,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions.
[2022-04-14 22:49:09,569 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions.
[2022-04-14 22:49:09,601 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:09,602 INFO  L225             Difference]: With dead ends: 36
[2022-04-14 22:49:09,602 INFO  L226             Difference]: Without dead ends: 36
[2022-04-14 22:49:09,603 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-14 22:49:09,603 INFO  L913         BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-14 22:49:09,604 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-14 22:49:09,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-14 22:49:09,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34.
[2022-04-14 22:49:09,607 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:49:09,607 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:09,608 INFO  L74              IsIncluded]: Start isIncluded. First operand 36 states. Second operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:09,608 INFO  L87              Difference]: Start difference. First operand 36 states. Second operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:09,610 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:09,610 INFO  L93              Difference]: Finished difference Result 36 states and 41 transitions.
[2022-04-14 22:49:09,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions.
[2022-04-14 22:49:09,611 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:09,611 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:09,611 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states.
[2022-04-14 22:49:09,611 INFO  L87              Difference]: Start difference. First operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states.
[2022-04-14 22:49:09,613 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:09,613 INFO  L93              Difference]: Finished difference Result 36 states and 41 transitions.
[2022-04-14 22:49:09,614 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions.
[2022-04-14 22:49:09,614 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:09,614 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:09,614 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:49:09,614 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:49:09,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:49:09,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions.
[2022-04-14 22:49:09,616 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34
[2022-04-14 22:49:09,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:49:09,616 INFO  L478      AbstractCegarLoop]: Abstraction has 34 states and 38 transitions.
[2022-04-14 22:49:09,617 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:09,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions.
[2022-04-14 22:49:09,617 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-14 22:49:09,617 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:49:09,618 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 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-14 22:49:09,646 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-14 22:49:09,843 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-14 22:49:09,843 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:49:09,844 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:49:09,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -1096608558, now seen corresponding path program 1 times
[2022-04-14 22:49:09,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:49:09,844 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932828491]
[2022-04-14 22:49:09,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:09,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:49:09,870 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:49:09,871 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979780324]
[2022-04-14 22:49:09,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:09,871 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:49:09,871 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:49:09,880 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-14 22:49:09,891 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-14 22:49:09,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:09,935 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core
[2022-04-14 22:49:09,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:09,955 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:49:11,522 INFO  L272        TraceCheckUtils]: 0: Hoare triple {655#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,522 INFO  L290        TraceCheckUtils]: 1: Hoare triple {655#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {655#true} is VALID
[2022-04-14 22:49:11,522 INFO  L290        TraceCheckUtils]: 2: Hoare triple {655#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,523 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,523 INFO  L272        TraceCheckUtils]: 4: Hoare triple {655#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,523 INFO  L290        TraceCheckUtils]: 5: Hoare triple {655#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:11,523 INFO  L272        TraceCheckUtils]: 6: Hoare triple {655#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:11,523 INFO  L290        TraceCheckUtils]: 7: Hoare triple {655#true} [82] assume_abort_if_notENTRY-->L10: 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] {655#true} is VALID
[2022-04-14 22:49:11,523 INFO  L290        TraceCheckUtils]: 8: Hoare triple {655#true} [85] L10-->L10-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[] {655#true} is VALID
[2022-04-14 22:49:11,524 INFO  L290        TraceCheckUtils]: 9: Hoare triple {655#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,524 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {655#true} {655#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:11,524 INFO  L290        TraceCheckUtils]: 11: Hoare triple {655#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {655#true} is VALID
[2022-04-14 22:49:11,524 INFO  L272        TraceCheckUtils]: 12: Hoare triple {655#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:11,524 INFO  L290        TraceCheckUtils]: 13: Hoare triple {655#true} [82] assume_abort_if_notENTRY-->L10: 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] {655#true} is VALID
[2022-04-14 22:49:11,525 INFO  L290        TraceCheckUtils]: 14: Hoare triple {655#true} [85] L10-->L10-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[] {655#true} is VALID
[2022-04-14 22:49:11,525 INFO  L290        TraceCheckUtils]: 15: Hoare triple {655#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,525 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {655#true} {655#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:11,525 INFO  L272        TraceCheckUtils]: 17: Hoare triple {655#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:11,525 INFO  L290        TraceCheckUtils]: 18: Hoare triple {655#true} [82] assume_abort_if_notENTRY-->L10: 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] {655#true} is VALID
[2022-04-14 22:49:11,525 INFO  L290        TraceCheckUtils]: 19: Hoare triple {655#true} [85] L10-->L10-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[] {655#true} is VALID
[2022-04-14 22:49:11,526 INFO  L290        TraceCheckUtils]: 20: Hoare triple {655#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,526 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {655#true} {655#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:11,527 INFO  L290        TraceCheckUtils]: 22: Hoare triple {655#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:11,528 INFO  L290        TraceCheckUtils]: 23: Hoare triple {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:11,528 INFO  L272        TraceCheckUtils]: 24: Hoare triple {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:11,528 INFO  L290        TraceCheckUtils]: 25: Hoare triple {655#true} [95] __VERIFIER_assertENTRY-->L13: 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] {655#true} is VALID
[2022-04-14 22:49:11,528 INFO  L290        TraceCheckUtils]: 26: Hoare triple {655#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,528 INFO  L290        TraceCheckUtils]: 27: Hoare triple {655#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:11,529 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {655#true} {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:11,530 INFO  L290        TraceCheckUtils]: 29: Hoare triple {726#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {748#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:11,531 INFO  L290        TraceCheckUtils]: 30: Hoare triple {748#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {752#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:49:11,532 INFO  L290        TraceCheckUtils]: 31: Hoare triple {752#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {756#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID
[2022-04-14 22:49:11,533 INFO  L290        TraceCheckUtils]: 32: Hoare triple {756#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {756#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID
[2022-04-14 22:49:11,768 INFO  L272        TraceCheckUtils]: 33: Hoare triple {756#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:49:11,769 INFO  L290        TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {767#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:49:11,773 INFO  L290        TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {656#false} is VALID
[2022-04-14 22:49:11,774 INFO  L290        TraceCheckUtils]: 36: Hoare triple {656#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {656#false} is VALID
[2022-04-14 22:49:11,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-14 22:49:11,774 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:49:29,435 INFO  L290        TraceCheckUtils]: 36: Hoare triple {656#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {656#false} is VALID
[2022-04-14 22:49:29,436 INFO  L290        TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {656#false} is VALID
[2022-04-14 22:49:29,436 INFO  L290        TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {767#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:49:29,438 INFO  L272        TraceCheckUtils]: 33: Hoare triple {783#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:49:29,438 INFO  L290        TraceCheckUtils]: 32: Hoare triple {783#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {783#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:49:29,443 INFO  L290        TraceCheckUtils]: 31: Hoare triple {790#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {783#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:49:29,445 INFO  L290        TraceCheckUtils]: 30: Hoare triple {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {790#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID
[2022-04-14 22:49:29,446 INFO  L290        TraceCheckUtils]: 29: Hoare triple {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID
[2022-04-14 22:49:29,447 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {655#true} {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID
[2022-04-14 22:49:29,447 INFO  L290        TraceCheckUtils]: 27: Hoare triple {655#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,448 INFO  L290        TraceCheckUtils]: 26: Hoare triple {655#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,448 INFO  L290        TraceCheckUtils]: 25: Hoare triple {655#true} [95] __VERIFIER_assertENTRY-->L13: 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] {655#true} is VALID
[2022-04-14 22:49:29,448 INFO  L272        TraceCheckUtils]: 24: Hoare triple {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:29,448 INFO  L290        TraceCheckUtils]: 23: Hoare triple {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID
[2022-04-14 22:49:29,959 INFO  L290        TraceCheckUtils]: 22: Hoare triple {655#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {794#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID
[2022-04-14 22:49:29,960 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {655#true} {655#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:29,960 INFO  L290        TraceCheckUtils]: 20: Hoare triple {655#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,960 INFO  L290        TraceCheckUtils]: 19: Hoare triple {655#true} [85] L10-->L10-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[] {655#true} is VALID
[2022-04-14 22:49:29,960 INFO  L290        TraceCheckUtils]: 18: Hoare triple {655#true} [82] assume_abort_if_notENTRY-->L10: 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] {655#true} is VALID
[2022-04-14 22:49:29,960 INFO  L272        TraceCheckUtils]: 17: Hoare triple {655#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:29,960 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {655#true} {655#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:29,960 INFO  L290        TraceCheckUtils]: 15: Hoare triple {655#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,961 INFO  L290        TraceCheckUtils]: 14: Hoare triple {655#true} [85] L10-->L10-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[] {655#true} is VALID
[2022-04-14 22:49:29,961 INFO  L290        TraceCheckUtils]: 13: Hoare triple {655#true} [82] assume_abort_if_notENTRY-->L10: 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] {655#true} is VALID
[2022-04-14 22:49:29,961 INFO  L272        TraceCheckUtils]: 12: Hoare triple {655#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {655#true} is VALID
[2022-04-14 22:49:29,961 INFO  L290        TraceCheckUtils]: 11: Hoare triple {655#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {655#true} is VALID
[2022-04-14 22:49:29,961 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {655#true} {655#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:29,961 INFO  L290        TraceCheckUtils]: 9: Hoare triple {655#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L290        TraceCheckUtils]: 8: Hoare triple {655#true} [85] L10-->L10-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[] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L290        TraceCheckUtils]: 7: Hoare triple {655#true} [82] assume_abort_if_notENTRY-->L10: 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] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L272        TraceCheckUtils]: 6: Hoare triple {655#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L290        TraceCheckUtils]: 5: Hoare triple {655#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L272        TraceCheckUtils]: 4: Hoare triple {655#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,962 INFO  L290        TraceCheckUtils]: 2: Hoare triple {655#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,963 INFO  L290        TraceCheckUtils]: 1: Hoare triple {655#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {655#true} is VALID
[2022-04-14 22:49:29,963 INFO  L272        TraceCheckUtils]: 0: Hoare triple {655#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {655#true} is VALID
[2022-04-14 22:49:29,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-14 22:49:29,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:49:29,963 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932828491]
[2022-04-14 22:49:29,963 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:49:29,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979780324]
[2022-04-14 22:49:29,964 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [979780324] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-14 22:49:29,964 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-14 22:49:29,964 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11
[2022-04-14 22:49:29,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182218338]
[2022-04-14 22:49:29,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 22:49:29,965 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37
[2022-04-14 22:49:29,965 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:49:29,965 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:31,205 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:31,205 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-14 22:49:31,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:49:31,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-14 22:49:31,206 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-04-14 22:49:31,206 INFO  L87              Difference]: Start difference. First operand 34 states and 38 transitions. Second operand  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:32,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:32,345 INFO  L93              Difference]: Finished difference Result 45 states and 51 transitions.
[2022-04-14 22:49:32,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2022-04-14 22:49:32,345 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37
[2022-04-14 22:49:32,345 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:49:32,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:32,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions.
[2022-04-14 22:49:32,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:32,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions.
[2022-04-14 22:49:32,348 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions.
[2022-04-14 22:49:32,404 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:49:32,406 INFO  L225             Difference]: With dead ends: 45
[2022-04-14 22:49:32,406 INFO  L226             Difference]: Without dead ends: 45
[2022-04-14 22:49:32,406 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2022-04-14 22:49:32,407 INFO  L913         BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-14 22:49:32,407 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 100 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-14 22:49:32,408 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2022-04-14 22:49:32,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43.
[2022-04-14 22:49:32,412 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:49:32,412 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand  has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-14 22:49:32,412 INFO  L74              IsIncluded]: Start isIncluded. First operand 45 states. Second operand  has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-14 22:49:32,413 INFO  L87              Difference]: Start difference. First operand 45 states. Second operand  has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-14 22:49:32,414 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:32,414 INFO  L93              Difference]: Finished difference Result 45 states and 51 transitions.
[2022-04-14 22:49:32,414 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions.
[2022-04-14 22:49:32,414 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:32,414 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:32,415 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states.
[2022-04-14 22:49:32,415 INFO  L87              Difference]: Start difference. First operand  has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states.
[2022-04-14 22:49:32,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:49:32,417 INFO  L93              Difference]: Finished difference Result 45 states and 51 transitions.
[2022-04-14 22:49:32,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions.
[2022-04-14 22:49:32,417 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:49:32,417 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:49:32,418 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:49:32,418 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:49:32,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-14 22:49:32,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions.
[2022-04-14 22:49:32,420 INFO  L78                 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37
[2022-04-14 22:49:32,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:49:32,420 INFO  L478      AbstractCegarLoop]: Abstraction has 43 states and 49 transitions.
[2022-04-14 22:49:32,423 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-14 22:49:32,423 INFO  L276                IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions.
[2022-04-14 22:49:32,423 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-14 22:49:32,423 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:49:32,424 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 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-14 22:49:32,440 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-14 22:49:32,624 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-14 22:49:32,625 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:49:32,625 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:49:32,625 INFO  L85        PathProgramCache]: Analyzing trace with hash -209104877, now seen corresponding path program 1 times
[2022-04-14 22:49:32,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:49:32,625 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134887464]
[2022-04-14 22:49:32,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:32,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:49:32,666 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:49:32,667 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906580094]
[2022-04-14 22:49:32,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:49:32,667 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:49:32,667 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:49:32,668 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-14 22:49:32,675 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-14 22:49:32,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:32,713 INFO  L263         TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core
[2022-04-14 22:49:32,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:49:32,726 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:49:34,002 INFO  L272        TraceCheckUtils]: 0: Hoare triple {1069#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:49:34,003 INFO  L290        TraceCheckUtils]: 1: Hoare triple {1069#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {1069#true} is VALID
[2022-04-14 22:49:34,003 INFO  L290        TraceCheckUtils]: 2: Hoare triple {1069#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:49:34,003 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {1069#true} {1069#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:49:34,003 INFO  L272        TraceCheckUtils]: 4: Hoare triple {1069#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:49:34,003 INFO  L290        TraceCheckUtils]: 5: Hoare triple {1069#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1069#true} is VALID
[2022-04-14 22:49:34,003 INFO  L272        TraceCheckUtils]: 6: Hoare triple {1069#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L290        TraceCheckUtils]: 7: Hoare triple {1069#true} [82] assume_abort_if_notENTRY-->L10: 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] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L290        TraceCheckUtils]: 8: Hoare triple {1069#true} [85] L10-->L10-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[] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L290        TraceCheckUtils]: 9: Hoare triple {1069#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {1069#true} {1069#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L290        TraceCheckUtils]: 11: Hoare triple {1069#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L272        TraceCheckUtils]: 12: Hoare triple {1069#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1069#true} is VALID
[2022-04-14 22:49:34,004 INFO  L290        TraceCheckUtils]: 13: Hoare triple {1069#true} [82] assume_abort_if_notENTRY-->L10: 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] {1069#true} is VALID
[2022-04-14 22:49:34,005 INFO  L290        TraceCheckUtils]: 14: Hoare triple {1069#true} [85] L10-->L10-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[] {1069#true} is VALID
[2022-04-14 22:49:34,005 INFO  L290        TraceCheckUtils]: 15: Hoare triple {1069#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:49:34,005 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {1069#true} {1069#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1069#true} is VALID
[2022-04-14 22:49:34,005 INFO  L272        TraceCheckUtils]: 17: Hoare triple {1069#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1069#true} is VALID
[2022-04-14 22:49:34,027 INFO  L290        TraceCheckUtils]: 18: Hoare triple {1069#true} [82] assume_abort_if_notENTRY-->L10: 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] {1128#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-14 22:49:34,028 INFO  L290        TraceCheckUtils]: 19: Hoare triple {1128#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [85] L10-->L10-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[] {1132#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:49:34,028 INFO  L290        TraceCheckUtils]: 20: Hoare triple {1132#(not (= |assume_abort_if_not_#in~cond| 0))} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1132#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:49:34,029 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {1132#(not (= |assume_abort_if_not_#in~cond| 0))} {1069#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1139#(<= 1 main_~b~0)} is VALID
[2022-04-14 22:49:34,030 INFO  L290        TraceCheckUtils]: 22: Hoare triple {1139#(<= 1 main_~b~0)} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:34,030 INFO  L290        TraceCheckUtils]: 23: Hoare triple {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:34,030 INFO  L272        TraceCheckUtils]: 24: Hoare triple {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1069#true} is VALID
[2022-04-14 22:49:34,031 INFO  L290        TraceCheckUtils]: 25: Hoare triple {1069#true} [95] __VERIFIER_assertENTRY-->L13: 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] {1153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:49:34,031 INFO  L290        TraceCheckUtils]: 26: Hoare triple {1153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:49:34,031 INFO  L290        TraceCheckUtils]: 27: Hoare triple {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:49:34,032 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:34,033 INFO  L290        TraceCheckUtils]: 29: Hoare triple {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:34,034 INFO  L290        TraceCheckUtils]: 30: Hoare triple {1143#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {1170#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:49:34,035 INFO  L290        TraceCheckUtils]: 31: Hoare triple {1170#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {1174#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID
[2022-04-14 22:49:34,035 INFO  L290        TraceCheckUtils]: 32: Hoare triple {1174#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1174#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID
[2022-04-14 22:49:34,037 INFO  L272        TraceCheckUtils]: 33: Hoare triple {1174#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:49:34,038 INFO  L290        TraceCheckUtils]: 34: Hoare triple {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {1185#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:49:34,038 INFO  L290        TraceCheckUtils]: 35: Hoare triple {1185#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {1070#false} is VALID
[2022-04-14 22:49:34,038 INFO  L290        TraceCheckUtils]: 36: Hoare triple {1070#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1070#false} is VALID
[2022-04-14 22:49:34,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-14 22:49:34,038 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:50:08,507 INFO  L290        TraceCheckUtils]: 36: Hoare triple {1070#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1070#false} is VALID
[2022-04-14 22:50:08,507 INFO  L290        TraceCheckUtils]: 35: Hoare triple {1185#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {1070#false} is VALID
[2022-04-14 22:50:08,508 INFO  L290        TraceCheckUtils]: 34: Hoare triple {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {1185#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:50:08,509 INFO  L272        TraceCheckUtils]: 33: Hoare triple {1201#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:50:08,509 INFO  L290        TraceCheckUtils]: 32: Hoare triple {1201#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1201#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:50:08,515 INFO  L290        TraceCheckUtils]: 31: Hoare triple {1208#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {1201#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:50:08,516 INFO  L290        TraceCheckUtils]: 30: Hoare triple {1212#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {1208#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID
[2022-04-14 22:50:08,517 INFO  L290        TraceCheckUtils]: 29: Hoare triple {1212#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {1212#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID
[2022-04-14 22:50:08,523 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} {1219#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1212#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID
[2022-04-14 22:50:08,524 INFO  L290        TraceCheckUtils]: 27: Hoare triple {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:50:08,524 INFO  L290        TraceCheckUtils]: 26: Hoare triple {1229#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:50:08,524 INFO  L290        TraceCheckUtils]: 25: Hoare triple {1069#true} [95] __VERIFIER_assertENTRY-->L13: 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] {1229#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 22:50:08,525 INFO  L272        TraceCheckUtils]: 24: Hoare triple {1219#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1069#true} is VALID
[2022-04-14 22:50:08,525 INFO  L290        TraceCheckUtils]: 23: Hoare triple {1219#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1219#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:50:08,526 INFO  L290        TraceCheckUtils]: 22: Hoare triple {1239#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1219#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:50:08,527 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {1132#(not (= |assume_abort_if_not_#in~cond| 0))} {1069#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1239#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:50:08,527 INFO  L290        TraceCheckUtils]: 20: Hoare triple {1132#(not (= |assume_abort_if_not_#in~cond| 0))} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1132#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:50:08,528 INFO  L290        TraceCheckUtils]: 19: Hoare triple {1252#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [85] L10-->L10-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[] {1132#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:50:08,528 INFO  L290        TraceCheckUtils]: 18: Hoare triple {1069#true} [82] assume_abort_if_notENTRY-->L10: 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] {1252#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID
[2022-04-14 22:50:08,528 INFO  L272        TraceCheckUtils]: 17: Hoare triple {1069#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1069#true} is VALID
[2022-04-14 22:50:08,528 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {1069#true} {1069#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L290        TraceCheckUtils]: 15: Hoare triple {1069#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L290        TraceCheckUtils]: 14: Hoare triple {1069#true} [85] L10-->L10-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[] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L290        TraceCheckUtils]: 13: Hoare triple {1069#true} [82] assume_abort_if_notENTRY-->L10: 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] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L272        TraceCheckUtils]: 12: Hoare triple {1069#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L290        TraceCheckUtils]: 11: Hoare triple {1069#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {1069#true} {1069#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L290        TraceCheckUtils]: 9: Hoare triple {1069#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:50:08,529 INFO  L290        TraceCheckUtils]: 8: Hoare triple {1069#true} [85] L10-->L10-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[] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L290        TraceCheckUtils]: 7: Hoare triple {1069#true} [82] assume_abort_if_notENTRY-->L10: 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] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L272        TraceCheckUtils]: 6: Hoare triple {1069#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L290        TraceCheckUtils]: 5: Hoare triple {1069#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L272        TraceCheckUtils]: 4: Hoare triple {1069#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {1069#true} {1069#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L290        TraceCheckUtils]: 2: Hoare triple {1069#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L290        TraceCheckUtils]: 1: Hoare triple {1069#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {1069#true} is VALID
[2022-04-14 22:50:08,530 INFO  L272        TraceCheckUtils]: 0: Hoare triple {1069#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1069#true} is VALID
[2022-04-14 22:50:08,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-14 22:50:08,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:50:08,531 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134887464]
[2022-04-14 22:50:08,531 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:50:08,531 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906580094]
[2022-04-14 22:50:08,531 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [906580094] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-14 22:50:08,531 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-14 22:50:08,531 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19
[2022-04-14 22:50:08,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848646836]
[2022-04-14 22:50:08,532 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-14 22:50:08,532 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37
[2022-04-14 22:50:08,533 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:50:08,533 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)
[2022-04-14 22:50:08,586 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:50:08,586 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-14 22:50:08,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:50:08,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-14 22:50:08,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342
[2022-04-14 22:50:08,587 INFO  L87              Difference]: Start difference. First operand 43 states and 49 transitions. Second operand  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)
[2022-04-14 22:50:11,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:50:11,137 INFO  L93              Difference]: Finished difference Result 61 states and 73 transitions.
[2022-04-14 22:50:11,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-04-14 22:50:11,137 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37
[2022-04-14 22:50:11,137 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:50:11,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)
[2022-04-14 22:50:11,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions.
[2022-04-14 22:50:11,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)
[2022-04-14 22:50:11,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions.
[2022-04-14 22:50:11,143 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 61 transitions.
[2022-04-14 22:50:11,217 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:50:11,218 INFO  L225             Difference]: With dead ends: 61
[2022-04-14 22:50:11,218 INFO  L226             Difference]: Without dead ends: 61
[2022-04-14 22:50:11,219 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650
[2022-04-14 22:50:11,220 INFO  L913         BasicCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-04-14 22:50:11,220 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 134 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-04-14 22:50:11,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2022-04-14 22:50:11,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2022-04-14 22:50:11,226 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:50:11,226 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand  has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:11,227 INFO  L74              IsIncluded]: Start isIncluded. First operand 61 states. Second operand  has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:11,227 INFO  L87              Difference]: Start difference. First operand 61 states. Second operand  has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:11,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:50:11,233 INFO  L93              Difference]: Finished difference Result 61 states and 73 transitions.
[2022-04-14 22:50:11,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions.
[2022-04-14 22:50:11,234 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:50:11,234 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:50:11,234 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states.
[2022-04-14 22:50:11,235 INFO  L87              Difference]: Start difference. First operand  has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states.
[2022-04-14 22:50:11,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:50:11,237 INFO  L93              Difference]: Finished difference Result 61 states and 73 transitions.
[2022-04-14 22:50:11,237 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions.
[2022-04-14 22:50:11,238 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:50:11,238 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:50:11,238 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:50:11,238 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:50:11,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:11,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions.
[2022-04-14 22:50:11,241 INFO  L78                 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 37
[2022-04-14 22:50:11,241 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:50:11,241 INFO  L478      AbstractCegarLoop]: Abstraction has 61 states and 73 transitions.
[2022-04-14 22:50:11,241 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)
[2022-04-14 22:50:11,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions.
[2022-04-14 22:50:11,242 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-14 22:50:11,242 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:50:11,242 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:50:11,259 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-14 22:50:11,447 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-14 22:50:11,447 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:50:11,448 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:50:11,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -266261558, now seen corresponding path program 1 times
[2022-04-14 22:50:11,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:50:11,448 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661026711]
[2022-04-14 22:50:11,448 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:50:11,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:50:11,485 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:50:11,485 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528038880]
[2022-04-14 22:50:11,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:50:11,485 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:50:11,485 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:50:11,486 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-14 22:50:11,487 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-14 22:50:11,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:50:11,538 INFO  L263         TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-14 22:50:11,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:50:11,549 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:50:15,956 INFO  L272        TraceCheckUtils]: 0: Hoare triple {1567#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,956 INFO  L290        TraceCheckUtils]: 1: Hoare triple {1567#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {1567#true} is VALID
[2022-04-14 22:50:15,956 INFO  L290        TraceCheckUtils]: 2: Hoare triple {1567#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L272        TraceCheckUtils]: 4: Hoare triple {1567#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L290        TraceCheckUtils]: 5: Hoare triple {1567#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L272        TraceCheckUtils]: 6: Hoare triple {1567#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L290        TraceCheckUtils]: 7: Hoare triple {1567#true} [82] assume_abort_if_notENTRY-->L10: 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] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L290        TraceCheckUtils]: 8: Hoare triple {1567#true} [85] L10-->L10-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[] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L290        TraceCheckUtils]: 9: Hoare triple {1567#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,957 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {1567#true} {1567#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L290        TraceCheckUtils]: 11: Hoare triple {1567#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L272        TraceCheckUtils]: 12: Hoare triple {1567#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L290        TraceCheckUtils]: 13: Hoare triple {1567#true} [82] assume_abort_if_notENTRY-->L10: 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] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L290        TraceCheckUtils]: 14: Hoare triple {1567#true} [85] L10-->L10-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[] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L290        TraceCheckUtils]: 15: Hoare triple {1567#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {1567#true} {1567#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L272        TraceCheckUtils]: 17: Hoare triple {1567#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:15,958 INFO  L290        TraceCheckUtils]: 18: Hoare triple {1567#true} [82] assume_abort_if_notENTRY-->L10: 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] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L290        TraceCheckUtils]: 19: Hoare triple {1567#true} [85] L10-->L10-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[] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L290        TraceCheckUtils]: 20: Hoare triple {1567#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {1567#true} {1567#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L290        TraceCheckUtils]: 22: Hoare triple {1567#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L290        TraceCheckUtils]: 23: Hoare triple {1567#true} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L272        TraceCheckUtils]: 24: Hoare triple {1567#true} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L290        TraceCheckUtils]: 25: Hoare triple {1567#true} [95] __VERIFIER_assertENTRY-->L13: 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] {1567#true} is VALID
[2022-04-14 22:50:15,959 INFO  L290        TraceCheckUtils]: 26: Hoare triple {1567#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L290        TraceCheckUtils]: 27: Hoare triple {1567#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {1567#true} {1567#true} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L290        TraceCheckUtils]: 29: Hoare triple {1567#true} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L290        TraceCheckUtils]: 30: Hoare triple {1567#true} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L290        TraceCheckUtils]: 31: Hoare triple {1567#true} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L290        TraceCheckUtils]: 32: Hoare triple {1567#true} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:15,960 INFO  L272        TraceCheckUtils]: 33: Hoare triple {1567#true} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:15,967 INFO  L290        TraceCheckUtils]: 34: Hoare triple {1567#true} [95] __VERIFIER_assertENTRY-->L13: 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] {1674#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:50:15,968 INFO  L290        TraceCheckUtils]: 35: Hoare triple {1674#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:50:15,968 INFO  L290        TraceCheckUtils]: 36: Hoare triple {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:50:17,970 WARN  L284        TraceCheckUtils]: 37: Hoare quadruple {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} {1567#true} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1685#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN
[2022-04-14 22:50:17,971 INFO  L290        TraceCheckUtils]: 38: Hoare triple {1685#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} [96] L35-1-->L34-3: Formula: (= v_main_~y~0_9 0)  InVars {main_~y~0=v_main_~y~0_9}  OutVars{main_~y~0=v_main_~y~0_9}  AuxVars[]  AssignedVars[] {1689#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:50:17,972 INFO  L272        TraceCheckUtils]: 39: Hoare triple {1689#(= main_~z~0 (* main_~b~0 main_~a~0))} [92] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_8 (* v_main_~a~0_10 v_main_~b~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~b~0=v_main_~b~0_11, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_10}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~b~0, main_~a~0] {1693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:50:17,972 INFO  L290        TraceCheckUtils]: 40: Hoare triple {1693#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {1697#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:50:17,972 INFO  L290        TraceCheckUtils]: 41: Hoare triple {1697#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {1568#false} is VALID
[2022-04-14 22:50:17,973 INFO  L290        TraceCheckUtils]: 42: Hoare triple {1568#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1568#false} is VALID
[2022-04-14 22:50:17,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-14 22:50:17,973 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:50:27,936 INFO  L290        TraceCheckUtils]: 42: Hoare triple {1568#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1568#false} is VALID
[2022-04-14 22:50:27,937 INFO  L290        TraceCheckUtils]: 41: Hoare triple {1697#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {1568#false} is VALID
[2022-04-14 22:50:27,938 INFO  L290        TraceCheckUtils]: 40: Hoare triple {1693#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {1697#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:50:27,939 INFO  L272        TraceCheckUtils]: 39: Hoare triple {1689#(= main_~z~0 (* main_~b~0 main_~a~0))} [92] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_8 (* v_main_~a~0_10 v_main_~b~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~b~0=v_main_~b~0_11, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_10}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~b~0, main_~a~0] {1693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:50:27,939 INFO  L290        TraceCheckUtils]: 38: Hoare triple {1716#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} [96] L35-1-->L34-3: Formula: (= v_main_~y~0_9 0)  InVars {main_~y~0=v_main_~y~0_9}  OutVars{main_~y~0=v_main_~y~0_9}  AuxVars[]  AssignedVars[] {1689#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:50:27,940 INFO  L284        TraceCheckUtils]: 37: Hoare quadruple {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} {1567#true} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1716#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:50:27,940 INFO  L290        TraceCheckUtils]: 36: Hoare triple {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:50:27,941 INFO  L290        TraceCheckUtils]: 35: Hoare triple {1729#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1678#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:50:27,941 INFO  L290        TraceCheckUtils]: 34: Hoare triple {1567#true} [95] __VERIFIER_assertENTRY-->L13: 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] {1729#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 22:50:27,941 INFO  L272        TraceCheckUtils]: 33: Hoare triple {1567#true} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 32: Hoare triple {1567#true} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 31: Hoare triple {1567#true} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 30: Hoare triple {1567#true} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 29: Hoare triple {1567#true} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {1567#true} {1567#true} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 27: Hoare triple {1567#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 26: Hoare triple {1567#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,942 INFO  L290        TraceCheckUtils]: 25: Hoare triple {1567#true} [95] __VERIFIER_assertENTRY-->L13: 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] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L272        TraceCheckUtils]: 24: Hoare triple {1567#true} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L290        TraceCheckUtils]: 23: Hoare triple {1567#true} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L290        TraceCheckUtils]: 22: Hoare triple {1567#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {1567#true} {1567#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L290        TraceCheckUtils]: 20: Hoare triple {1567#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L290        TraceCheckUtils]: 19: Hoare triple {1567#true} [85] L10-->L10-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[] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L290        TraceCheckUtils]: 18: Hoare triple {1567#true} [82] assume_abort_if_notENTRY-->L10: 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] {1567#true} is VALID
[2022-04-14 22:50:27,943 INFO  L272        TraceCheckUtils]: 17: Hoare triple {1567#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {1567#true} {1567#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L290        TraceCheckUtils]: 15: Hoare triple {1567#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L290        TraceCheckUtils]: 14: Hoare triple {1567#true} [85] L10-->L10-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[] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L290        TraceCheckUtils]: 13: Hoare triple {1567#true} [82] assume_abort_if_notENTRY-->L10: 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] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L272        TraceCheckUtils]: 12: Hoare triple {1567#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L290        TraceCheckUtils]: 11: Hoare triple {1567#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {1567#true} {1567#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:27,944 INFO  L290        TraceCheckUtils]: 9: Hoare triple {1567#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L290        TraceCheckUtils]: 8: Hoare triple {1567#true} [85] L10-->L10-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[] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L290        TraceCheckUtils]: 7: Hoare triple {1567#true} [82] assume_abort_if_notENTRY-->L10: 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] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L272        TraceCheckUtils]: 6: Hoare triple {1567#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L290        TraceCheckUtils]: 5: Hoare triple {1567#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L272        TraceCheckUtils]: 4: Hoare triple {1567#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L290        TraceCheckUtils]: 2: Hoare triple {1567#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L290        TraceCheckUtils]: 1: Hoare triple {1567#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {1567#true} is VALID
[2022-04-14 22:50:27,945 INFO  L272        TraceCheckUtils]: 0: Hoare triple {1567#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1567#true} is VALID
[2022-04-14 22:50:27,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-14 22:50:27,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:50:27,946 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661026711]
[2022-04-14 22:50:27,946 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:50:27,946 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528038880]
[2022-04-14 22:50:27,946 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [528038880] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-14 22:50:27,946 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-14 22:50:27,946 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2022-04-14 22:50:27,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913075115]
[2022-04-14 22:50:27,946 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-14 22:50:27,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43
[2022-04-14 22:50:27,953 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:50:27,954 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7)
[2022-04-14 22:50:29,985 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:50:29,986 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-14 22:50:29,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:50:29,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-14 22:50:29,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-04-14 22:50:29,987 INFO  L87              Difference]: Start difference. First operand 61 states and 73 transitions. Second operand  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7)
[2022-04-14 22:50:32,058 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-14 22:50:32,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:50:32,776 INFO  L93              Difference]: Finished difference Result 66 states and 77 transitions.
[2022-04-14 22:50:32,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2022-04-14 22:50:32,776 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43
[2022-04-14 22:50:32,777 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:50:32,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7)
[2022-04-14 22:50:32,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions.
[2022-04-14 22:50:32,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7)
[2022-04-14 22:50:32,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions.
[2022-04-14 22:50:32,779 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions.
[2022-04-14 22:50:34,808 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:50:34,809 INFO  L225             Difference]: With dead ends: 66
[2022-04-14 22:50:34,810 INFO  L226             Difference]: Without dead ends: 61
[2022-04-14 22:50:34,810 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2022-04-14 22:50:34,810 INFO  L913         BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2022-04-14 22:50:34,811 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 118 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time]
[2022-04-14 22:50:34,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2022-04-14 22:50:34,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60.
[2022-04-14 22:50:34,815 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:50:34,815 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand  has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:34,816 INFO  L74              IsIncluded]: Start isIncluded. First operand 61 states. Second operand  has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:34,816 INFO  L87              Difference]: Start difference. First operand 61 states. Second operand  has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:34,818 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:50:34,818 INFO  L93              Difference]: Finished difference Result 61 states and 70 transitions.
[2022-04-14 22:50:34,818 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions.
[2022-04-14 22:50:34,818 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:50:34,819 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:50:34,819 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states.
[2022-04-14 22:50:34,819 INFO  L87              Difference]: Start difference. First operand  has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states.
[2022-04-14 22:50:34,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:50:34,821 INFO  L93              Difference]: Finished difference Result 61 states and 70 transitions.
[2022-04-14 22:50:34,821 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions.
[2022-04-14 22:50:34,822 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:50:34,822 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:50:34,822 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:50:34,822 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:50:34,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-14 22:50:34,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions.
[2022-04-14 22:50:34,824 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 43
[2022-04-14 22:50:34,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:50:34,824 INFO  L478      AbstractCegarLoop]: Abstraction has 60 states and 69 transitions.
[2022-04-14 22:50:34,824 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7)
[2022-04-14 22:50:34,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions.
[2022-04-14 22:50:34,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2022-04-14 22:50:34,825 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:50:34,825 INFO  L499         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:50:34,850 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-14 22:50:35,047 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-14 22:50:35,047 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:50:35,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:50:35,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -1353204359, now seen corresponding path program 1 times
[2022-04-14 22:50:35,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:50:35,048 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499712924]
[2022-04-14 22:50:35,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:50:35,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:50:35,070 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:50:35,071 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128110187]
[2022-04-14 22:50:35,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:50:35,071 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:50:35,071 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:50:35,072 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-14 22:50:35,072 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-04-14 22:50:35,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:50:35,110 INFO  L263         TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-04-14 22:50:38,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2022-04-14 22:50:38,655 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:51:10,914 WARN  L914       QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-14 22:51:28,829 INFO  L272        TraceCheckUtils]: 0: Hoare triple {2086#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2086#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L290        TraceCheckUtils]: 2: Hoare triple {2086#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {2086#true} {2086#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L272        TraceCheckUtils]: 4: Hoare triple {2086#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L290        TraceCheckUtils]: 5: Hoare triple {2086#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L272        TraceCheckUtils]: 6: Hoare triple {2086#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {2086#true} is VALID
[2022-04-14 22:51:28,830 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2086#true} [82] assume_abort_if_notENTRY-->L10: 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] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2086#true} [85] L10-->L10-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[] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2086#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {2086#true} {2086#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L290        TraceCheckUtils]: 11: Hoare triple {2086#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L272        TraceCheckUtils]: 12: Hoare triple {2086#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2086#true} [82] assume_abort_if_notENTRY-->L10: 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] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L290        TraceCheckUtils]: 14: Hoare triple {2086#true} [85] L10-->L10-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[] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L290        TraceCheckUtils]: 15: Hoare triple {2086#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {2086#true} {2086#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2086#true} is VALID
[2022-04-14 22:51:28,831 INFO  L272        TraceCheckUtils]: 17: Hoare triple {2086#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2086#true} is VALID
[2022-04-14 22:51:28,832 INFO  L290        TraceCheckUtils]: 18: Hoare triple {2086#true} [82] assume_abort_if_notENTRY-->L10: 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] {2086#true} is VALID
[2022-04-14 22:51:28,832 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2086#true} [85] L10-->L10-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[] {2086#true} is VALID
[2022-04-14 22:51:28,832 INFO  L290        TraceCheckUtils]: 20: Hoare triple {2086#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,832 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {2086#true} {2086#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2086#true} is VALID
[2022-04-14 22:51:28,832 INFO  L290        TraceCheckUtils]: 22: Hoare triple {2086#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2157#(= main_~a~0 main_~x~0)} is VALID
[2022-04-14 22:51:28,832 INFO  L290        TraceCheckUtils]: 23: Hoare triple {2157#(= main_~a~0 main_~x~0)} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2157#(= main_~a~0 main_~x~0)} is VALID
[2022-04-14 22:51:28,833 INFO  L272        TraceCheckUtils]: 24: Hoare triple {2157#(= main_~a~0 main_~x~0)} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2086#true} is VALID
[2022-04-14 22:51:28,833 INFO  L290        TraceCheckUtils]: 25: Hoare triple {2086#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2086#true} is VALID
[2022-04-14 22:51:28,833 INFO  L290        TraceCheckUtils]: 26: Hoare triple {2086#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,833 INFO  L290        TraceCheckUtils]: 27: Hoare triple {2086#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2086#true} is VALID
[2022-04-14 22:51:28,833 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {2086#true} {2157#(= main_~a~0 main_~x~0)} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2157#(= main_~a~0 main_~x~0)} is VALID
[2022-04-14 22:51:28,834 INFO  L290        TraceCheckUtils]: 29: Hoare triple {2157#(= main_~a~0 main_~x~0)} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2179#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:51:28,834 INFO  L290        TraceCheckUtils]: 30: Hoare triple {2179#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {2183#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:51:28,835 INFO  L290        TraceCheckUtils]: 31: Hoare triple {2183#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2187#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:51:28,835 INFO  L290        TraceCheckUtils]: 32: Hoare triple {2187#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2187#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:51:28,836 INFO  L272        TraceCheckUtils]: 33: Hoare triple {2187#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2086#true} is VALID
[2022-04-14 22:51:28,836 INFO  L290        TraceCheckUtils]: 34: Hoare triple {2086#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2197#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:51:28,836 INFO  L290        TraceCheckUtils]: 35: Hoare triple {2197#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2201#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:51:28,837 INFO  L290        TraceCheckUtils]: 36: Hoare triple {2201#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2201#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:51:28,838 INFO  L284        TraceCheckUtils]: 37: Hoare quadruple {2201#(not (= |__VERIFIER_assert_#in~cond| 0))} {2187#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2208#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:51:28,838 INFO  L290        TraceCheckUtils]: 38: Hoare triple {2208#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2208#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:51:28,839 INFO  L290        TraceCheckUtils]: 39: Hoare triple {2208#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {2215#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:51:28,955 INFO  L290        TraceCheckUtils]: 40: Hoare triple {2215#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2219#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} is VALID
[2022-04-14 22:51:30,956 WARN  L290        TraceCheckUtils]: 41: Hoare triple {2219#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2223#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is UNKNOWN
[2022-04-14 22:51:31,797 INFO  L272        TraceCheckUtils]: 42: Hoare triple {2223#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:51:31,798 INFO  L290        TraceCheckUtils]: 43: Hoare triple {2227#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {2231#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:51:31,798 INFO  L290        TraceCheckUtils]: 44: Hoare triple {2231#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {2087#false} is VALID
[2022-04-14 22:51:31,799 INFO  L290        TraceCheckUtils]: 45: Hoare triple {2087#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2087#false} is VALID
[2022-04-14 22:51:31,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-04-14 22:51:31,799 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:51:52,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:51:52,185 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499712924]
[2022-04-14 22:51:52,185 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:51:52,185 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128110187]
[2022-04-14 22:51:52,185 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128110187] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-14 22:51:52,185 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-14 22:51:52,185 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2022-04-14 22:51:52,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107164606]
[2022-04-14 22:51:52,185 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2022-04-14 22:51:52,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46
[2022-04-14 22:51:52,186 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:51:52,186 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-14 22:51:54,716 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:51:54,718 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-14 22:51:54,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:51:54,718 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-14 22:51:54,718 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2022-04-14 22:51:54,718 INFO  L87              Difference]: Start difference. First operand 60 states and 69 transitions. Second operand  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-14 22:51:58,877 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-14 22:52:00,350 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-14 22:52:02,328 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-14 22:52:02,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:52:02,390 INFO  L93              Difference]: Finished difference Result 79 states and 90 transitions.
[2022-04-14 22:52:02,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-04-14 22:52:02,390 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46
[2022-04-14 22:52:02,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:52:02,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-14 22:52:02,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions.
[2022-04-14 22:52:02,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-14 22:52:02,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions.
[2022-04-14 22:52:02,396 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 51 transitions.
[2022-04-14 22:52:04,021 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:52:04,023 INFO  L225             Difference]: With dead ends: 79
[2022-04-14 22:52:04,023 INFO  L226             Difference]: Without dead ends: 79
[2022-04-14 22:52:04,023 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380
[2022-04-14 22:52:04,024 INFO  L913         BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time
[2022-04-14 22:52:04,024 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 1 Unknown, 27 Unchecked, 6.7s Time]
[2022-04-14 22:52:04,025 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2022-04-14 22:52:04,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2022-04-14 22:52:04,031 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:52:04,031 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand  has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-14 22:52:04,031 INFO  L74              IsIncluded]: Start isIncluded. First operand 79 states. Second operand  has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-14 22:52:04,032 INFO  L87              Difference]: Start difference. First operand 79 states. Second operand  has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-14 22:52:04,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:52:04,034 INFO  L93              Difference]: Finished difference Result 79 states and 90 transitions.
[2022-04-14 22:52:04,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions.
[2022-04-14 22:52:04,035 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:52:04,035 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:52:04,035 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 79 states.
[2022-04-14 22:52:04,035 INFO  L87              Difference]: Start difference. First operand  has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 79 states.
[2022-04-14 22:52:04,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:52:04,038 INFO  L93              Difference]: Finished difference Result 79 states and 90 transitions.
[2022-04-14 22:52:04,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions.
[2022-04-14 22:52:04,038 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:52:04,038 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:52:04,039 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:52:04,039 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:52:04,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-14 22:52:04,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions.
[2022-04-14 22:52:04,041 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 46
[2022-04-14 22:52:04,041 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:52:04,041 INFO  L478      AbstractCegarLoop]: Abstraction has 79 states and 90 transitions.
[2022-04-14 22:52:04,042 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-14 22:52:04,042 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions.
[2022-04-14 22:52:04,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2022-04-14 22:52:04,042 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:52:04,042 INFO  L499         BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:52:04,061 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2022-04-14 22:52:04,255 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:52:04,255 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:52:04,256 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:52:04,256 INFO  L85        PathProgramCache]: Analyzing trace with hash -172555565, now seen corresponding path program 2 times
[2022-04-14 22:52:04,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:52:04,256 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134820370]
[2022-04-14 22:52:04,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:52:04,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:52:04,271 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:52:04,271 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086400535]
[2022-04-14 22:52:04,271 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-14 22:52:04,272 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:52:04,272 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:52:04,272 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-14 22:52:04,275 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-04-14 22:52:04,367 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-14 22:52:04,367 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-14 22:52:04,368 INFO  L263         TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 51 conjunts are in the unsatisfiable core
[2022-04-14 22:52:04,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:52:04,389 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:52:57,623 WARN  L914       QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-14 22:52:58,674 INFO  L272        TraceCheckUtils]: 0: Hoare triple {2589#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,674 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2589#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {2589#true} is VALID
[2022-04-14 22:52:58,674 INFO  L290        TraceCheckUtils]: 2: Hoare triple {2589#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,674 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,674 INFO  L272        TraceCheckUtils]: 4: Hoare triple {2589#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L290        TraceCheckUtils]: 5: Hoare triple {2589#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L272        TraceCheckUtils]: 6: Hoare triple {2589#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2589#true} [82] assume_abort_if_notENTRY-->L10: 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] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2589#true} [85] L10-->L10-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[] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2589#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {2589#true} {2589#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L290        TraceCheckUtils]: 11: Hoare triple {2589#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L272        TraceCheckUtils]: 12: Hoare triple {2589#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:52:58,675 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2589#true} [82] assume_abort_if_notENTRY-->L10: 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] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L290        TraceCheckUtils]: 14: Hoare triple {2589#true} [85] L10-->L10-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[] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L290        TraceCheckUtils]: 15: Hoare triple {2589#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {2589#true} {2589#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L272        TraceCheckUtils]: 17: Hoare triple {2589#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L290        TraceCheckUtils]: 18: Hoare triple {2589#true} [82] assume_abort_if_notENTRY-->L10: 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] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2589#true} [85] L10-->L10-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[] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L290        TraceCheckUtils]: 20: Hoare triple {2589#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:52:58,676 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {2589#true} {2589#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:52:58,680 INFO  L290        TraceCheckUtils]: 22: Hoare triple {2589#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2660#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:52:58,681 INFO  L290        TraceCheckUtils]: 23: Hoare triple {2660#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2660#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:52:58,681 INFO  L272        TraceCheckUtils]: 24: Hoare triple {2660#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:52:58,681 INFO  L290        TraceCheckUtils]: 25: Hoare triple {2589#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2670#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:52:58,681 INFO  L290        TraceCheckUtils]: 26: Hoare triple {2670#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:52:58,682 INFO  L290        TraceCheckUtils]: 27: Hoare triple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:52:58,682 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} {2660#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2681#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:52:58,683 INFO  L290        TraceCheckUtils]: 29: Hoare triple {2681#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2685#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-14 22:52:58,684 INFO  L290        TraceCheckUtils]: 30: Hoare triple {2685#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {2689#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID
[2022-04-14 22:52:58,687 INFO  L290        TraceCheckUtils]: 31: Hoare triple {2689#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID
[2022-04-14 22:52:58,687 INFO  L290        TraceCheckUtils]: 32: Hoare triple {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID
[2022-04-14 22:52:58,687 INFO  L272        TraceCheckUtils]: 33: Hoare triple {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:52:58,687 INFO  L290        TraceCheckUtils]: 34: Hoare triple {2589#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2670#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:52:58,688 INFO  L290        TraceCheckUtils]: 35: Hoare triple {2670#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:52:58,688 INFO  L290        TraceCheckUtils]: 36: Hoare triple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:52:58,689 INFO  L284        TraceCheckUtils]: 37: Hoare quadruple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID
[2022-04-14 22:52:58,689 INFO  L290        TraceCheckUtils]: 38: Hoare triple {2693#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2715#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID
[2022-04-14 22:52:58,690 INFO  L290        TraceCheckUtils]: 39: Hoare triple {2715#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {2719#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:52:58,691 INFO  L290        TraceCheckUtils]: 40: Hoare triple {2719#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2723#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:52:58,692 INFO  L290        TraceCheckUtils]: 41: Hoare triple {2723#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2723#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:52:58,692 INFO  L272        TraceCheckUtils]: 42: Hoare triple {2723#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:52:58,692 INFO  L290        TraceCheckUtils]: 43: Hoare triple {2589#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2670#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:52:58,693 INFO  L290        TraceCheckUtils]: 44: Hoare triple {2670#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:52:58,693 INFO  L290        TraceCheckUtils]: 45: Hoare triple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:52:58,694 INFO  L284        TraceCheckUtils]: 46: Hoare quadruple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} {2723#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2742#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:52:58,694 INFO  L290        TraceCheckUtils]: 47: Hoare triple {2742#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2742#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:52:58,695 INFO  L290        TraceCheckUtils]: 48: Hoare triple {2742#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {2749#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:52:58,699 INFO  L290        TraceCheckUtils]: 49: Hoare triple {2749#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2753#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:52:58,700 INFO  L290        TraceCheckUtils]: 50: Hoare triple {2753#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2753#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:52:58,708 INFO  L272        TraceCheckUtils]: 51: Hoare triple {2753#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:52:58,708 INFO  L290        TraceCheckUtils]: 52: Hoare triple {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {2764#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:52:58,708 INFO  L290        TraceCheckUtils]: 53: Hoare triple {2764#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {2590#false} is VALID
[2022-04-14 22:52:58,708 INFO  L290        TraceCheckUtils]: 54: Hoare triple {2590#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2590#false} is VALID
[2022-04-14 22:52:58,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-14 22:52:58,709 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:55:01,079 INFO  L290        TraceCheckUtils]: 54: Hoare triple {2590#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2590#false} is VALID
[2022-04-14 22:55:01,079 INFO  L290        TraceCheckUtils]: 53: Hoare triple {2764#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {2590#false} is VALID
[2022-04-14 22:55:01,079 INFO  L290        TraceCheckUtils]: 52: Hoare triple {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {2764#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:55:01,080 INFO  L272        TraceCheckUtils]: 51: Hoare triple {2780#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:55:01,080 INFO  L290        TraceCheckUtils]: 50: Hoare triple {2780#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2780#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:55:01,089 INFO  L290        TraceCheckUtils]: 49: Hoare triple {2787#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2780#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:55:01,090 INFO  L290        TraceCheckUtils]: 48: Hoare triple {2791#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {2787#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID
[2022-04-14 22:55:01,091 INFO  L290        TraceCheckUtils]: 47: Hoare triple {2791#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2791#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID
[2022-04-14 22:55:01,094 INFO  L284        TraceCheckUtils]: 46: Hoare quadruple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} {2798#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2791#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID
[2022-04-14 22:55:01,094 INFO  L290        TraceCheckUtils]: 45: Hoare triple {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:55:01,094 INFO  L290        TraceCheckUtils]: 44: Hoare triple {2808#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:55:01,095 INFO  L290        TraceCheckUtils]: 43: Hoare triple {2589#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2808#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 22:55:01,095 INFO  L272        TraceCheckUtils]: 42: Hoare triple {2798#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,095 INFO  L290        TraceCheckUtils]: 41: Hoare triple {2798#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2798#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:55:01,154 INFO  L290        TraceCheckUtils]: 40: Hoare triple {2818#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2798#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID
[2022-04-14 22:55:01,156 INFO  L290        TraceCheckUtils]: 39: Hoare triple {2589#true} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {2818#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} is VALID
[2022-04-14 22:55:01,156 INFO  L290        TraceCheckUtils]: 38: Hoare triple {2589#true} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,156 INFO  L284        TraceCheckUtils]: 37: Hoare quadruple {2589#true} {2589#true} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,156 INFO  L290        TraceCheckUtils]: 36: Hoare triple {2589#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 35: Hoare triple {2589#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 34: Hoare triple {2589#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L272        TraceCheckUtils]: 33: Hoare triple {2589#true} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 32: Hoare triple {2589#true} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 31: Hoare triple {2589#true} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 30: Hoare triple {2589#true} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 29: Hoare triple {2589#true} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {2589#true} {2589#true} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 27: Hoare triple {2589#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 26: Hoare triple {2589#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L290        TraceCheckUtils]: 25: Hoare triple {2589#true} [95] __VERIFIER_assertENTRY-->L13: 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] {2589#true} is VALID
[2022-04-14 22:55:01,157 INFO  L272        TraceCheckUtils]: 24: Hoare triple {2589#true} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L290        TraceCheckUtils]: 23: Hoare triple {2589#true} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L290        TraceCheckUtils]: 22: Hoare triple {2589#true} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {2589#true} {2589#true} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L290        TraceCheckUtils]: 20: Hoare triple {2589#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L290        TraceCheckUtils]: 19: Hoare triple {2589#true} [85] L10-->L10-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[] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L290        TraceCheckUtils]: 18: Hoare triple {2589#true} [82] assume_abort_if_notENTRY-->L10: 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] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L272        TraceCheckUtils]: 17: Hoare triple {2589#true} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {2589#true} {2589#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:55:01,158 INFO  L290        TraceCheckUtils]: 15: Hoare triple {2589#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L290        TraceCheckUtils]: 14: Hoare triple {2589#true} [85] L10-->L10-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[] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L290        TraceCheckUtils]: 13: Hoare triple {2589#true} [82] assume_abort_if_notENTRY-->L10: 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] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L272        TraceCheckUtils]: 12: Hoare triple {2589#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L290        TraceCheckUtils]: 11: Hoare triple {2589#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {2589#true} {2589#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L290        TraceCheckUtils]: 9: Hoare triple {2589#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L290        TraceCheckUtils]: 8: Hoare triple {2589#true} [85] L10-->L10-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[] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L290        TraceCheckUtils]: 7: Hoare triple {2589#true} [82] assume_abort_if_notENTRY-->L10: 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] {2589#true} is VALID
[2022-04-14 22:55:01,159 INFO  L272        TraceCheckUtils]: 6: Hoare triple {2589#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L290        TraceCheckUtils]: 5: Hoare triple {2589#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L272        TraceCheckUtils]: 4: Hoare triple {2589#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L290        TraceCheckUtils]: 2: Hoare triple {2589#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L290        TraceCheckUtils]: 1: Hoare triple {2589#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L272        TraceCheckUtils]: 0: Hoare triple {2589#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {2589#true} is VALID
[2022-04-14 22:55:01,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2022-04-14 22:55:01,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:55:01,161 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134820370]
[2022-04-14 22:55:01,161 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:55:01,161 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086400535]
[2022-04-14 22:55:01,161 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086400535] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-14 22:55:01,161 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-14 22:55:01,161 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23
[2022-04-14 22:55:01,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374999401]
[2022-04-14 22:55:01,161 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-14 22:55:01,162 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55
[2022-04-14 22:55:01,162 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:55:01,163 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2022-04-14 22:55:01,278 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:55:01,278 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-04-14 22:55:01,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:55:01,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-04-14 22:55:01,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=411, Unknown=1, NotChecked=0, Total=506
[2022-04-14 22:55:01,279 INFO  L87              Difference]: Start difference. First operand 79 states and 90 transitions. Second operand  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2022-04-14 22:55:08,975 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-14 22:55:38,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:55:38,027 INFO  L93              Difference]: Finished difference Result 100 states and 114 transitions.
[2022-04-14 22:55:38,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2022-04-14 22:55:38,027 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55
[2022-04-14 22:55:38,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:55:38,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2022-04-14 22:55:38,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions.
[2022-04-14 22:55:38,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2022-04-14 22:55:38,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions.
[2022-04-14 22:55:38,032 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 70 transitions.
[2022-04-14 22:55:42,136 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:55:42,138 INFO  L225             Difference]: With dead ends: 100
[2022-04-14 22:55:42,138 INFO  L226             Difference]: Without dead ends: 100
[2022-04-14 22:55:42,138 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=154, Invalid=657, Unknown=1, NotChecked=0, Total=812
[2022-04-14 22:55:42,139 INFO  L913         BasicCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time
[2022-04-14 22:55:42,139 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 177 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 256 Invalid, 1 Unknown, 36 Unchecked, 8.1s Time]
[2022-04-14 22:55:42,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2022-04-14 22:55:42,145 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93.
[2022-04-14 22:55:42,145 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:55:42,145 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand  has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15)
[2022-04-14 22:55:42,145 INFO  L74              IsIncluded]: Start isIncluded. First operand 100 states. Second operand  has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15)
[2022-04-14 22:55:42,146 INFO  L87              Difference]: Start difference. First operand 100 states. Second operand  has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15)
[2022-04-14 22:55:42,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:55:42,149 INFO  L93              Difference]: Finished difference Result 100 states and 114 transitions.
[2022-04-14 22:55:42,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions.
[2022-04-14 22:55:42,149 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:55:42,149 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:55:42,150 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) Second operand 100 states.
[2022-04-14 22:55:42,150 INFO  L87              Difference]: Start difference. First operand  has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) Second operand 100 states.
[2022-04-14 22:55:42,153 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:55:42,153 INFO  L93              Difference]: Finished difference Result 100 states and 114 transitions.
[2022-04-14 22:55:42,153 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions.
[2022-04-14 22:55:42,154 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:55:42,154 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:55:42,154 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:55:42,154 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:55:42,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15)
[2022-04-14 22:55:42,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions.
[2022-04-14 22:55:42,157 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 55
[2022-04-14 22:55:42,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:55:42,157 INFO  L478      AbstractCegarLoop]: Abstraction has 93 states and 107 transitions.
[2022-04-14 22:55:42,157 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9)
[2022-04-14 22:55:42,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions.
[2022-04-14 22:55:42,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2022-04-14 22:55:42,158 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-14 22:55:42,158 INFO  L499         BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:55:42,180 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-04-14 22:55:42,371 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:55:42,371 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:55:42,372 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:55:42,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 2101955993, now seen corresponding path program 3 times
[2022-04-14 22:55:42,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:55:42,372 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281800091]
[2022-04-14 22:55:42,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:55:42,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:55:42,385 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:55:42,385 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916088100]
[2022-04-14 22:55:42,385 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-04-14 22:55:42,385 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:55:42,385 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:55:42,386 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-14 22:55:42,389 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-04-14 22:55:42,467 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2022-04-14 22:55:42,468 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-14 22:55:42,469 INFO  L263         TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-04-14 22:55:42,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:55:42,496 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:56:06,628 WARN  L914       QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-14 22:56:16,095 INFO  L272        TraceCheckUtils]: 0: Hoare triple {3347#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,095 INFO  L290        TraceCheckUtils]: 1: Hoare triple {3347#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {3347#true} is VALID
[2022-04-14 22:56:16,095 INFO  L290        TraceCheckUtils]: 2: Hoare triple {3347#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,095 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {3347#true} {3347#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,095 INFO  L272        TraceCheckUtils]: 4: Hoare triple {3347#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L290        TraceCheckUtils]: 5: Hoare triple {3347#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L272        TraceCheckUtils]: 6: Hoare triple {3347#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L290        TraceCheckUtils]: 7: Hoare triple {3347#true} [82] assume_abort_if_notENTRY-->L10: 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] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L290        TraceCheckUtils]: 8: Hoare triple {3347#true} [85] L10-->L10-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[] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L290        TraceCheckUtils]: 9: Hoare triple {3347#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {3347#true} {3347#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L290        TraceCheckUtils]: 11: Hoare triple {3347#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {3347#true} is VALID
[2022-04-14 22:56:16,096 INFO  L272        TraceCheckUtils]: 12: Hoare triple {3347#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3347#true} is VALID
[2022-04-14 22:56:16,103 INFO  L290        TraceCheckUtils]: 13: Hoare triple {3347#true} [82] assume_abort_if_notENTRY-->L10: 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] {3391#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-14 22:56:16,104 INFO  L290        TraceCheckUtils]: 14: Hoare triple {3391#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [85] L10-->L10-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[] {3395#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:56:16,104 INFO  L290        TraceCheckUtils]: 15: Hoare triple {3395#(not (= |assume_abort_if_not_#in~cond| 0))} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3395#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:56:16,105 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {3395#(not (= |assume_abort_if_not_#in~cond| 0))} {3347#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3402#(and (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,105 INFO  L272        TraceCheckUtils]: 17: Hoare triple {3402#(and (<= main_~b~0 100) (<= 0 main_~b~0))} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3347#true} is VALID
[2022-04-14 22:56:16,105 INFO  L290        TraceCheckUtils]: 18: Hoare triple {3347#true} [82] assume_abort_if_notENTRY-->L10: 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] {3347#true} is VALID
[2022-04-14 22:56:16,105 INFO  L290        TraceCheckUtils]: 19: Hoare triple {3347#true} [85] L10-->L10-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[] {3347#true} is VALID
[2022-04-14 22:56:16,105 INFO  L290        TraceCheckUtils]: 20: Hoare triple {3347#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,105 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {3347#true} {3402#(and (<= main_~b~0 100) (<= 0 main_~b~0))} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3402#(and (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,106 INFO  L290        TraceCheckUtils]: 22: Hoare triple {3402#(and (<= main_~b~0 100) (<= 0 main_~b~0))} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,106 INFO  L290        TraceCheckUtils]: 23: Hoare triple {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,106 INFO  L272        TraceCheckUtils]: 24: Hoare triple {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,106 INFO  L290        TraceCheckUtils]: 25: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3347#true} is VALID
[2022-04-14 22:56:16,106 INFO  L290        TraceCheckUtils]: 26: Hoare triple {3347#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,106 INFO  L290        TraceCheckUtils]: 27: Hoare triple {3347#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,107 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {3347#true} {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,107 INFO  L290        TraceCheckUtils]: 29: Hoare triple {3421#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3443#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,108 INFO  L290        TraceCheckUtils]: 30: Hoare triple {3443#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {3447#(and (<= main_~b~0 (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,109 INFO  L290        TraceCheckUtils]: 31: Hoare triple {3447#(and (<= main_~b~0 (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,109 INFO  L290        TraceCheckUtils]: 32: Hoare triple {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,109 INFO  L272        TraceCheckUtils]: 33: Hoare triple {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,109 INFO  L290        TraceCheckUtils]: 34: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3347#true} is VALID
[2022-04-14 22:56:16,109 INFO  L290        TraceCheckUtils]: 35: Hoare triple {3347#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,109 INFO  L290        TraceCheckUtils]: 36: Hoare triple {3347#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,110 INFO  L284        TraceCheckUtils]: 37: Hoare quadruple {3347#true} {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,111 INFO  L290        TraceCheckUtils]: 38: Hoare triple {3451#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3473#(and (not (= main_~y~0 0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,111 INFO  L290        TraceCheckUtils]: 39: Hoare triple {3473#(and (not (= main_~y~0 0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {3477#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,117 INFO  L290        TraceCheckUtils]: 40: Hoare triple {3477#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3481#(and (exists ((aux_div_v_main_~y~0_46_22 Int) (aux_mod_v_main_~y~0_46_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_46_22) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22 1)) (< aux_mod_v_main_~y~0_46_22 2) (<= (div (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_46_22 1)) (not (= (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 0)))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,118 INFO  L290        TraceCheckUtils]: 41: Hoare triple {3481#(and (exists ((aux_div_v_main_~y~0_46_22 Int) (aux_mod_v_main_~y~0_46_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_46_22) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22 1)) (< aux_mod_v_main_~y~0_46_22 2) (<= (div (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_46_22 1)) (not (= (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 0)))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,118 INFO  L272        TraceCheckUtils]: 42: Hoare triple {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,118 INFO  L290        TraceCheckUtils]: 43: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3347#true} is VALID
[2022-04-14 22:56:16,118 INFO  L290        TraceCheckUtils]: 44: Hoare triple {3347#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,119 INFO  L290        TraceCheckUtils]: 45: Hoare triple {3347#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:56:16,119 INFO  L284        TraceCheckUtils]: 46: Hoare quadruple {3347#true} {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,120 INFO  L290        TraceCheckUtils]: 47: Hoare triple {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,120 INFO  L290        TraceCheckUtils]: 48: Hoare triple {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID
[2022-04-14 22:56:16,121 INFO  L290        TraceCheckUtils]: 49: Hoare triple {3485#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3510#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,122 INFO  L290        TraceCheckUtils]: 50: Hoare triple {3510#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3510#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,122 INFO  L272        TraceCheckUtils]: 51: Hoare triple {3510#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:56:16,122 INFO  L290        TraceCheckUtils]: 52: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:56:16,122 INFO  L290        TraceCheckUtils]: 53: Hoare triple {3520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:56:16,122 INFO  L290        TraceCheckUtils]: 54: Hoare triple {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:56:16,123 INFO  L284        TraceCheckUtils]: 55: Hoare quadruple {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} {3510#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3531#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,124 INFO  L290        TraceCheckUtils]: 56: Hoare triple {3531#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3531#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:16,134 INFO  L290        TraceCheckUtils]: 57: Hoare triple {3531#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {3538#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID
[2022-04-14 22:56:18,137 WARN  L290        TraceCheckUtils]: 58: Hoare triple {3538#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3542#(and (exists ((aux_div_v_main_~y~0_48_22 Int) (aux_mod_v_main_~y~0_48_22 Int)) (and (not (= aux_mod_v_main_~y~0_48_22 1)) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22 1)) (< aux_mod_v_main_~y~0_48_22 2) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22) 2)) (<= 0 aux_mod_v_main_~y~0_48_22))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is UNKNOWN
[2022-04-14 22:56:20,139 WARN  L290        TraceCheckUtils]: 59: Hoare triple {3542#(and (exists ((aux_div_v_main_~y~0_48_22 Int) (aux_mod_v_main_~y~0_48_22 Int)) (and (not (= aux_mod_v_main_~y~0_48_22 1)) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22 1)) (< aux_mod_v_main_~y~0_48_22 2) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22) 2)) (<= 0 aux_mod_v_main_~y~0_48_22))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3546#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is UNKNOWN
[2022-04-14 22:56:20,840 INFO  L272        TraceCheckUtils]: 60: Hoare triple {3546#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:56:20,840 INFO  L290        TraceCheckUtils]: 61: Hoare triple {3550#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {3554#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:56:20,841 INFO  L290        TraceCheckUtils]: 62: Hoare triple {3554#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {3348#false} is VALID
[2022-04-14 22:56:20,841 INFO  L290        TraceCheckUtils]: 63: Hoare triple {3348#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3348#false} is VALID
[2022-04-14 22:56:20,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-14 22:56:20,842 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:57:01,811 INFO  L290        TraceCheckUtils]: 63: Hoare triple {3348#false} [103] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3348#false} is VALID
[2022-04-14 22:57:01,812 INFO  L290        TraceCheckUtils]: 62: Hoare triple {3554#(<= 1 __VERIFIER_assert_~cond)} [99] L13-->L14: 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[] {3348#false} is VALID
[2022-04-14 22:57:01,812 INFO  L290        TraceCheckUtils]: 61: Hoare triple {3550#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L13: 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] {3554#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:57:01,813 INFO  L272        TraceCheckUtils]: 60: Hoare triple {3570#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:57:01,813 INFO  L290        TraceCheckUtils]: 59: Hoare triple {3570#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3570#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:57:01,818 INFO  L290        TraceCheckUtils]: 58: Hoare triple {3577#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3570#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID
[2022-04-14 22:57:01,819 INFO  L290        TraceCheckUtils]: 57: Hoare triple {3581#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {3577#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID
[2022-04-14 22:57:01,820 INFO  L290        TraceCheckUtils]: 56: Hoare triple {3581#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3581#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID
[2022-04-14 22:57:01,823 INFO  L284        TraceCheckUtils]: 55: Hoare quadruple {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} {3588#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3581#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID
[2022-04-14 22:57:01,823 INFO  L290        TraceCheckUtils]: 54: Hoare triple {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:57:01,823 INFO  L290        TraceCheckUtils]: 53: Hoare triple {3598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:57:01,824 INFO  L290        TraceCheckUtils]: 52: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 22:57:01,824 INFO  L272        TraceCheckUtils]: 51: Hoare triple {3588#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,824 INFO  L290        TraceCheckUtils]: 50: Hoare triple {3588#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3588#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID
[2022-04-14 22:57:01,825 INFO  L290        TraceCheckUtils]: 49: Hoare triple {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3588#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID
[2022-04-14 22:57:01,825 INFO  L290        TraceCheckUtils]: 48: Hoare triple {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID
[2022-04-14 22:57:01,826 INFO  L290        TraceCheckUtils]: 47: Hoare triple {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID
[2022-04-14 22:57:01,826 INFO  L284        TraceCheckUtils]: 46: Hoare quadruple {3347#true} {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID
[2022-04-14 22:57:01,827 INFO  L290        TraceCheckUtils]: 45: Hoare triple {3347#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,827 INFO  L290        TraceCheckUtils]: 44: Hoare triple {3347#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,827 INFO  L290        TraceCheckUtils]: 43: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3347#true} is VALID
[2022-04-14 22:57:01,827 INFO  L272        TraceCheckUtils]: 42: Hoare triple {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,827 INFO  L290        TraceCheckUtils]: 41: Hoare triple {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID
[2022-04-14 22:57:01,829 INFO  L290        TraceCheckUtils]: 40: Hoare triple {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3608#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID
[2022-04-14 22:57:01,829 INFO  L290        TraceCheckUtils]: 39: Hoare triple {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} [102] L39-->L39-2: Formula: (not (= (let ((.cse0 (mod v_main_~y~0_3 2))) (ite (and (< v_main_~y~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_3}  OutVars{main_~y~0=v_main_~y~0_3}  AuxVars[]  AssignedVars[] {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID
[2022-04-14 22:57:01,830 INFO  L290        TraceCheckUtils]: 38: Hoare triple {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID
[2022-04-14 22:57:01,830 INFO  L284        TraceCheckUtils]: 37: Hoare quadruple {3347#true} {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID
[2022-04-14 22:57:01,830 INFO  L290        TraceCheckUtils]: 36: Hoare triple {3347#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,830 INFO  L290        TraceCheckUtils]: 35: Hoare triple {3347#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,831 INFO  L290        TraceCheckUtils]: 34: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3347#true} is VALID
[2022-04-14 22:57:01,831 INFO  L272        TraceCheckUtils]: 33: Hoare triple {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,831 INFO  L290        TraceCheckUtils]: 32: Hoare triple {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID
[2022-04-14 22:57:01,834 INFO  L290        TraceCheckUtils]: 31: Hoare triple {3664#(and (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 3) (div (+ (div main_~y~0 2) (- 10)) 2)) 2)) 2))) (or (<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 11) (div main_~y~0 2)) 2) (- 3)) 2)) 2) 3)) (not (= (mod main_~y~0 2) 0))))} [106] L39-2-->L34-2: Formula: (and (= v_main_~y~0_4 (let ((.cse0 (div v_main_~y~0_5 2))) (ite (and (not (= (mod v_main_~y~0_5 2) 0)) (< v_main_~y~0_5 0)) (+ .cse0 1) .cse0))) (= v_main_~x~0_2 (* v_main_~x~0_3 2)))  InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5}  OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_4}  AuxVars[]  AssignedVars[main_~x~0, main_~y~0] {3636#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID
[2022-04-14 22:57:01,836 INFO  L290        TraceCheckUtils]: 30: Hoare triple {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} [101] L39-->L39-2: Formula: (and (= v_main_~y~0_1 (+ (- 1) v_main_~y~0_2)) (= v_main_~z~0_1 (+ v_main_~x~0_1 v_main_~z~0_2)) (= (let ((.cse0 (mod v_main_~y~0_2 2))) (ite (and (< v_main_~y~0_2 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 1))  InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2}  OutVars{main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1}  AuxVars[]  AssignedVars[main_~z~0, main_~y~0] {3664#(and (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 3) (div (+ (div main_~y~0 2) (- 10)) 2)) 2)) 2))) (or (<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 11) (div main_~y~0 2)) 2) (- 3)) 2)) 2) 3)) (not (= (mod main_~y~0 2) 0))))} is VALID
[2022-04-14 22:57:01,836 INFO  L290        TraceCheckUtils]: 29: Hoare triple {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} [97] L35-1-->L39: Formula: (not (= v_main_~y~0_10 0))  InVars {main_~y~0=v_main_~y~0_10}  OutVars{main_~y~0=v_main_~y~0_10}  AuxVars[]  AssignedVars[] {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID
[2022-04-14 22:57:01,837 INFO  L284        TraceCheckUtils]: 28: Hoare quadruple {3347#true} {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} [112] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID
[2022-04-14 22:57:01,837 INFO  L290        TraceCheckUtils]: 27: Hoare triple {3347#true} [105] L13-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,837 INFO  L290        TraceCheckUtils]: 26: Hoare triple {3347#true} [100] L13-->L13-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,837 INFO  L290        TraceCheckUtils]: 25: Hoare triple {3347#true} [95] __VERIFIER_assertENTRY-->L13: 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] {3347#true} is VALID
[2022-04-14 22:57:01,837 INFO  L272        TraceCheckUtils]: 24: Hoare triple {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} [93] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~z~0_7 (* v_main_~y~0_11 v_main_~x~0_7)) (* v_main_~a~0_9 v_main_~b~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_~b~0=v_main_~b~0_10, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_9}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,837 INFO  L290        TraceCheckUtils]: 23: Hoare triple {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} [91] L34-2-->L35: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID
[2022-04-14 22:57:01,838 INFO  L290        TraceCheckUtils]: 22: Hoare triple {3693#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} [88] L28-->L34-2: Formula: (and (= v_main_~z~0_5 0) (= v_main_~a~0_6 v_main_~x~0_5) (= v_main_~b~0_6 v_main_~y~0_7))  InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_6}  OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_6, main_~z~0=v_main_~z~0_5, main_~a~0=v_main_~a~0_6}  AuxVars[]  AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3668#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID
[2022-04-14 22:57:01,838 INFO  L284        TraceCheckUtils]: 21: Hoare quadruple {3347#true} {3693#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} [110] assume_abort_if_notEXIT-->L28: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3693#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} is VALID
[2022-04-14 22:57:01,838 INFO  L290        TraceCheckUtils]: 20: Hoare triple {3347#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,838 INFO  L290        TraceCheckUtils]: 19: Hoare triple {3347#true} [85] L10-->L10-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[] {3347#true} is VALID
[2022-04-14 22:57:01,838 INFO  L290        TraceCheckUtils]: 18: Hoare triple {3347#true} [82] assume_abort_if_notENTRY-->L10: 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] {3347#true} is VALID
[2022-04-14 22:57:01,838 INFO  L272        TraceCheckUtils]: 17: Hoare triple {3693#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} [86] L27-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~b~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_3|)  InVars {main_~b~0=v_main_~b~0_9}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3347#true} is VALID
[2022-04-14 22:57:01,839 INFO  L284        TraceCheckUtils]: 16: Hoare quadruple {3395#(not (= |assume_abort_if_not_#in~cond| 0))} {3347#true} [109] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3693#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} is VALID
[2022-04-14 22:57:01,840 INFO  L290        TraceCheckUtils]: 15: Hoare triple {3395#(not (= |assume_abort_if_not_#in~cond| 0))} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3395#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:57:01,840 INFO  L290        TraceCheckUtils]: 14: Hoare triple {3721#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [85] L10-->L10-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[] {3395#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 13: Hoare triple {3347#true} [82] assume_abort_if_notENTRY-->L10: 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] {3721#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID
[2022-04-14 22:57:01,841 INFO  L272        TraceCheckUtils]: 12: Hoare triple {3347#true} [83] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~b~0_8 100) (<= 0 v_main_~b~0_8)) 1 0))  InVars {main_~b~0=v_main_~b~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 11: Hoare triple {3347#true} [81] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~b~0_3 |v_main_#t~nondet5_2|))  InVars {main_#t~nondet5=|v_main_#t~nondet5_2|}  OutVars{main_~b~0=v_main_~b~0_3}  AuxVars[]  AssignedVars[main_#t~nondet5, main_~b~0] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {3347#true} {3347#true} [108] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 9: Hoare triple {3347#true} [87] L10-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 8: Hoare triple {3347#true} [85] L10-->L10-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[] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 7: Hoare triple {3347#true} [82] assume_abort_if_notENTRY-->L10: 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] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L272        TraceCheckUtils]: 6: Hoare triple {3347#true} [80] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 100)) 1 0))  InVars {main_~a~0=v_main_~a~0_8}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 5: Hoare triple {3347#true} [78] mainENTRY-->L25: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647))  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~z~0=v_main_~z~0_4, main_~a~0=v_main_~a~0_2}  AuxVars[]  AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~b~0, main_~a~0] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L272        TraceCheckUtils]: 4: Hoare triple {3347#true} [75] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {3347#true} {3347#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 2: Hoare triple {3347#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L290        TraceCheckUtils]: 1: Hoare triple {3347#true} [76] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {3347#true} is VALID
[2022-04-14 22:57:01,841 INFO  L272        TraceCheckUtils]: 0: Hoare triple {3347#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {3347#true} is VALID
[2022-04-14 22:57:01,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-14 22:57:01,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:57:01,842 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281800091]
[2022-04-14 22:57:01,842 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:57:01,842 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916088100]
[2022-04-14 22:57:01,842 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916088100] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-14 22:57:01,842 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-14 22:57:01,842 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 33
[2022-04-14 22:57:01,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413607604]
[2022-04-14 22:57:01,842 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-14 22:57:01,843 INFO  L78                 Accepts]: Start accepts. Automaton has  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64
[2022-04-14 22:57:01,844 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:57:01,844 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-14 22:57:03,409 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:57:03,409 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-04-14 22:57:03,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:57:03,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-04-14 22:57:03,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056
[2022-04-14 22:57:03,410 INFO  L87              Difference]: Start difference. First operand 93 states and 107 transitions. Second operand  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-14 22:58:06,893 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-14 22:58:07,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:58:07,145 INFO  L93              Difference]: Finished difference Result 113 states and 135 transitions.
[2022-04-14 22:58:07,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2022-04-14 22:58:07,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64
[2022-04-14 22:58:07,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:58:07,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-14 22:58:07,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions.
[2022-04-14 22:58:07,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-14 22:58:07,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions.
[2022-04-14 22:58:07,150 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions.
[2022-04-14 22:58:22,071 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 68 edges. 64 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. 
[2022-04-14 22:58:22,072 INFO  L225             Difference]: With dead ends: 113
[2022-04-14 22:58:22,072 INFO  L226             Difference]: Without dead ends: 0
[2022-04-14 22:58:22,072 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=550, Invalid=2100, Unknown=2, NotChecked=0, Total=2652
[2022-04-14 22:58:22,073 INFO  L913         BasicCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time
[2022-04-14 22:58:22,073 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 208 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 299 Invalid, 0 Unknown, 41 Unchecked, 6.4s Time]
[2022-04-14 22:58:22,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-14 22:58:22,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-14 22:58:22,074 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:58:22,074 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:58:22,074 INFO  L74              IsIncluded]: Start isIncluded. First operand 0 states. Second operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:58:22,074 INFO  L87              Difference]: Start difference. First operand 0 states. Second operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:58:22,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:58:22,074 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 22:58:22,074 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 22:58:22,074 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:58:22,074 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:58:22,075 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-14 22:58:22,075 INFO  L87              Difference]: Start difference. First operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-14 22:58:22,075 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:58:22,075 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 22:58:22,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 22:58:22,075 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:58:22,075 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:58:22,075 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:58:22,075 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:58:22,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:58:22,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-14 22:58:22,075 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64
[2022-04-14 22:58:22,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:58:22,076 INFO  L478      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-14 22:58:22,076 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-14 22:58:22,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 22:58:22,076 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:58:22,078 INFO  L788   garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-14 22:58:22,099 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2022-04-14 22:58:22,295 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2022-04-14 22:58:22,298 INFO  L719         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:58:22,299 INFO  L177   ceAbstractionStarter]: Computing trace abstraction results
[2022-04-14 22:58:22,300 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:58:22 BasicIcfg
[2022-04-14 22:58:22,300 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-14 22:58:22,301 INFO  L158              Benchmark]: Toolchain (without parser) took 555343.80ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 129.3MB in the beginning and 163.0MB in the end (delta: -33.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB.
[2022-04-14 22:58:22,301 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-14 22:58:22,301 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 227.20ms. Allocated memory is still 184.5MB. Free memory was 129.0MB in the beginning and 156.0MB in the end (delta: -27.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2022-04-14 22:58:22,302 INFO  L158              Benchmark]: Boogie Preprocessor took 52.22ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 154.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-14 22:58:22,302 INFO  L158              Benchmark]: RCFGBuilder took 324.77ms. Allocated memory is still 184.5MB. Free memory was 154.5MB in the beginning and 143.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-14 22:58:22,302 INFO  L158              Benchmark]: IcfgTransformer took 31.07ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 141.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-14 22:58:22,302 INFO  L158              Benchmark]: TraceAbstraction took 554698.47ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 141.3MB in the beginning and 163.0MB in the end (delta: -21.7MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB.
[2022-04-14 22:58:22,303 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - AssertionsEnabledResult: Assertions are enabled
    Assertions are enabled
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 227.20ms. Allocated memory is still 184.5MB. Free memory was 129.0MB in the beginning and 156.0MB in the end (delta: -27.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 52.22ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 154.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 324.77ms. Allocated memory is still 184.5MB. Free memory was 154.5MB in the beginning and 143.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
 * IcfgTransformer took 31.07ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 141.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * TraceAbstraction took 554698.47ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 141.3MB in the beginning and 163.0MB in the end (delta: -21.7MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 15]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 554.7s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 138.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 25.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 1102 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 104 IncrementalHoareTripleChecker+Unchecked, 878 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 224 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 475 SyntacticMatches, 14 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 79.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=8, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 406.0s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 594 ConstructedInterpolants, 4 QuantifiedInterpolants, 3987 SizeOfPredicates, 29 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 326/443 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2022-04-14 22:58:22,519 WARN  L435       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process
[2022-04-14 22:58:22,526 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...