/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/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:08:33,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:08:33,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:08:33,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:08:33,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:08:33,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:08:33,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:08:33,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:08:33,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:08:33,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:08:33,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:08:33,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:08:33,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:08:33,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:08:33,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:08:33,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:08:33,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:08:33,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:08:33,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:08:33,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:08:33,897 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:08:33,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:08:33,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:08:33,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:08:33,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:08:33,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:08:33,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:08:33,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:08:33,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:08:33,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:08:33,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:08:33,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:08:33,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:08:33,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:08:33,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:08:33,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:08:33,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:08:33,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:08:33,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:08:33,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:08:33,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:08:33,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:08:33,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:08:33,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:08:33,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:08:33,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:08:33,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:08:33,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:08:33,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:08:33,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:08:33,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:08:33,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:08:33,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:08:33,922 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:08:33,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:08:33,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:08:33,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:08:33,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:08:33,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:08:33,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:08:33,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:08:33,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:33,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:08:33,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:08:33,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:08:33,925 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 20:08:34,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:08:34,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:08:34,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:08:34,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:08:34,183 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:08:34,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-14 20:08:34,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa9f61f2/51298a040d5d49e0b6ebe2bab19b860b/FLAGd6397800b [2022-04-14 20:08:34,691 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:08:34,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-14 20:08:34,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa9f61f2/51298a040d5d49e0b6ebe2bab19b860b/FLAGd6397800b [2022-04-14 20:08:35,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa9f61f2/51298a040d5d49e0b6ebe2bab19b860b [2022-04-14 20:08:35,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:08:35,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:08:35,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:35,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:08:35,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:08:35,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f630a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35, skipping insertion in model container [2022-04-14 20:08:35,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:08:35,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:08:35,286 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/cohendiv-ll.c[576,589] [2022-04-14 20:08:35,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:35,317 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:08:35,327 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/cohendiv-ll.c[576,589] [2022-04-14 20:08:35,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:35,345 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:08:35,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35 WrapperNode [2022-04-14 20:08:35,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:35,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:08:35,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:08:35,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:08:35,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:08:35,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:08:35,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:08:35,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:08:35,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:35,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:35,404 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 20:08:35,432 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 20:08:35,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:08:35,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:08:35,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:08:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 20:08:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:08:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:08:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 20:08:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:08:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:08:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:08:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:08:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 20:08:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:08:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:08:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:08:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:08:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:08:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:08:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:08:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:08:35,512 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:08:35,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:08:35,733 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:08:35,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:08:35,738 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 20:08:35,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:35 BoogieIcfgContainer [2022-04-14 20:08:35,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:08:35,741 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:08:35,741 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:08:35,744 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:08:35,746 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:35" (1/1) ... [2022-04-14 20:08:35,748 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:08:35,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:35 BasicIcfg [2022-04-14 20:08:35,793 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:08:35,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:08:35,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:08:35,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:08:35,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:08:35" (1/4) ... [2022-04-14 20:08:35,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b08f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:35, skipping insertion in model container [2022-04-14 20:08:35,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:35" (2/4) ... [2022-04-14 20:08:35,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b08f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:35, skipping insertion in model container [2022-04-14 20:08:35,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:35" (3/4) ... [2022-04-14 20:08:35,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b08f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:35, skipping insertion in model container [2022-04-14 20:08:35,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:35" (4/4) ... [2022-04-14 20:08:35,802 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.cJordan [2022-04-14 20:08:35,806 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:08:35,806 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:08:35,856 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:08:35,867 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 20:08:35,868 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:08:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 20:08:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 20:08:35,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:35,891 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:35,892 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1858340770, now seen corresponding path program 1 times [2022-04-14 20:08:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:35,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073678427] [2022-04-14 20:08:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:36,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {39#true} is VALID [2022-04-14 20:08:36,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-14 20:08:36,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-14 20:08:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 20:08:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:36,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} [102] assume_abort_if_notENTRY-->L12: 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] {39#true} is VALID [2022-04-14 20:08:36,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [106] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#false} is VALID [2022-04-14 20:08:36,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:08:36,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {39#true} is VALID [2022-04-14 20:08:36,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-14 20:08:36,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-14 20:08:36,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-14 20:08:36,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {39#true} is VALID [2022-04-14 20:08:36,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {39#true} is VALID [2022-04-14 20:08:36,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} [102] assume_abort_if_notENTRY-->L12: 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] {39#true} is VALID [2022-04-14 20:08:36,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} [106] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#false} is VALID [2022-04-14 20:08:36,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {40#false} is VALID [2022-04-14 20:08:36,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} [103] L36-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,099 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} [108] L36-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {40#false} is VALID [2022-04-14 20:08:36,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40#false} is VALID [2022-04-14 20:08:36,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-14 20:08:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:08:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073678427] [2022-04-14 20:08:36,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073678427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:36,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:36,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:08:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121664433] [2022-04-14 20:08:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 20:08:36,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:36,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:36,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:08:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:08:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:08:36,158 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:36,305 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-14 20:08:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:08:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 20:08:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-14 20:08:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-14 20:08:36,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-04-14 20:08:36,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:36,421 INFO L225 Difference]: With dead ends: 36 [2022-04-14 20:08:36,421 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 20:08:36,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 20:08:36,425 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:36,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 20:08:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-14 20:08:36,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:36,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 20:08:36,456 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 20:08:36,457 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 20:08:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:36,466 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-14 20:08:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-14 20:08:36,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:36,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:36,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-14 20:08:36,469 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-14 20:08:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:36,475 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-14 20:08:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-14 20:08:36,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:36,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:36,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:36,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 20:08:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-14 20:08:36,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-14 20:08:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:36,494 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-14 20:08:36,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-14 20:08:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 20:08:36,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:36,495 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:36,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:08:36,495 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 52763140, now seen corresponding path program 1 times [2022-04-14 20:08:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:36,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453461531] [2022-04-14 20:08:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:36,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:08:36,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742787379] [2022-04-14 20:08:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:36,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:36,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:36,530 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 20:08:36,562 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 20:08:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:36,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:08:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:36,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:36,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-14 20:08:36,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {180#true} is VALID [2022-04-14 20:08:36,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-14 20:08:36,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-14 20:08:36,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-14 20:08:36,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {180#true} is VALID [2022-04-14 20:08:36,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {180#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {180#true} is VALID [2022-04-14 20:08:36,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#true} [102] assume_abort_if_notENTRY-->L12: 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] {180#true} is VALID [2022-04-14 20:08:36,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {180#true} [107] L12-->L12-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[] {180#true} is VALID [2022-04-14 20:08:36,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {180#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-14 20:08:36,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {180#true} {180#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {180#true} is VALID [2022-04-14 20:08:36,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {180#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {218#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 20:08:36,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {218#(and (= main_~a~0 0) (= main_~b~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 20:08:36,764 INFO L272 TraceCheckUtils]: 13: Hoare triple {218#(and (= main_~a~0 0) (= main_~b~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:36,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:36,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {181#false} is VALID [2022-04-14 20:08:36,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {181#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#false} is VALID [2022-04-14 20:08:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:08:36,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:08:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453461531] [2022-04-14 20:08:36,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:08:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742787379] [2022-04-14 20:08:36,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742787379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:36,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:36,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:08:36,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572960938] [2022-04-14 20:08:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 20:08:36,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:36,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:36,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:08:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:08:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:08:36,794 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:36,981 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-14 20:08:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:08:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-14 20:08:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-14 20:08:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-14 20:08:36,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-14 20:08:37,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:37,044 INFO L225 Difference]: With dead ends: 40 [2022-04-14 20:08:37,044 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 20:08:37,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 20:08:37,047 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:37,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 20:08:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-14 20:08:37,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:37,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:08:37,053 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:08:37,054 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:08:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:37,069 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-14 20:08:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-14 20:08:37,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:37,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:37,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-14 20:08:37,071 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-14 20:08:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:37,074 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-14 20:08:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-14 20:08:37,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:37,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:37,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:37,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:08:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-14 20:08:37,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-14 20:08:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:37,078 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-14 20:08:37,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 20:08:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-14 20:08:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 20:08:37,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:37,079 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:37,110 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 20:08:37,305 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 20:08:37,306 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash -791674298, now seen corresponding path program 1 times [2022-04-14 20:08:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:37,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738559261] [2022-04-14 20:08:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:37,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:08:37,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948693817] [2022-04-14 20:08:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:37,328 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 20:08:37,329 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 20:08:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:37,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:08:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:37,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:37,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {394#true} is VALID [2022-04-14 20:08:37,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {394#true} is VALID [2022-04-14 20:08:37,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {394#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {394#true} is VALID [2022-04-14 20:08:37,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#true} [102] assume_abort_if_notENTRY-->L12: 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] {394#true} is VALID [2022-04-14 20:08:37,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#true} [107] L12-->L12-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[] {394#true} is VALID [2022-04-14 20:08:37,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {394#true} {394#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {394#true} is VALID [2022-04-14 20:08:37,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:37,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:37,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {394#true} is VALID [2022-04-14 20:08:37,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {394#true} is VALID [2022-04-14 20:08:37,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {394#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 20:08:37,513 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {394#true} {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:37,514 INFO L272 TraceCheckUtils]: 18: Hoare triple {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:37,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {454#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:37,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {458#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 20:08:37,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 20:08:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:08:37,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:08:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:37,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738559261] [2022-04-14 20:08:37,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:08:37,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948693817] [2022-04-14 20:08:37,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948693817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:37,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:37,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:08:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634683999] [2022-04-14 20:08:37,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:37,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 20:08:37,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:37,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:08:37,539 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 20:08:37,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:08:37,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:08:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:08:37,540 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:08:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:37,766 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-04-14 20:08:37,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:08:37,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 20:08:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:08:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-14 20:08:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:08:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-14 20:08:37,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-14 20:08:37,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:37,835 INFO L225 Difference]: With dead ends: 52 [2022-04-14 20:08:37,835 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 20:08:37,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 20:08:37,836 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:37,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:08:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 20:08:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-14 20:08:37,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:37,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 20:08:37,842 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 20:08:37,842 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 20:08:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:37,846 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-14 20:08:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-14 20:08:37,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:37,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:37,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-14 20:08:37,847 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-14 20:08:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:37,850 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-14 20:08:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-14 20:08:37,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:37,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:37,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:37,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 20:08:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-14 20:08:37,854 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-14 20:08:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:37,854 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-14 20:08:37,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 20:08:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 20:08:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 20:08:37,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:37,855 INFO L499 BasicCegarLoop]: trace histogram [3, 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 20:08:37,883 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 20:08:38,069 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 20:08:38,069 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1388492510, now seen corresponding path program 1 times [2022-04-14 20:08:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:38,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495324345] [2022-04-14 20:08:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:38,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:08:38,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344958896] [2022-04-14 20:08:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:38,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:38,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:38,092 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 20:08:38,119 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 20:08:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:38,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:08:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:38,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:38,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {670#true} is VALID [2022-04-14 20:08:38,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {670#true} is VALID [2022-04-14 20:08:38,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-14 20:08:38,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {670#true} is VALID [2022-04-14 20:08:38,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-14 20:08:38,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {670#true} is VALID [2022-04-14 20:08:38,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,300 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {670#true} is VALID [2022-04-14 20:08:38,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#true} is VALID [2022-04-14 20:08:38,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {670#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,301 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {670#true} {670#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {670#true} is VALID [2022-04-14 20:08:38,301 INFO L272 TraceCheckUtils]: 18: Hoare triple {670#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {670#true} is VALID [2022-04-14 20:08:38,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {670#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#true} is VALID [2022-04-14 20:08:38,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {670#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-14 20:08:38,302 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {670#true} {670#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {670#true} is VALID [2022-04-14 20:08:38,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {670#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-14 20:08:38,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-14 20:08:38,304 INFO L272 TraceCheckUtils]: 25: Hoare triple {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:38,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {751#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:38,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {755#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-14 20:08:38,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-14 20:08:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 20:08:38,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:08:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:38,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495324345] [2022-04-14 20:08:38,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:08:38,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344958896] [2022-04-14 20:08:38,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344958896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:38,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:38,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:08:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815686011] [2022-04-14 20:08:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-14 20:08:38,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:38,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20:08:38,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:38,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:08:38,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:38,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:08:38,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:08:38,348 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20:08:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:38,610 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-14 20:08:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:08:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-14 20:08:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20:08:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-14 20:08:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20:08:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-14 20:08:38,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-14 20:08:38,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:38,687 INFO L225 Difference]: With dead ends: 74 [2022-04-14 20:08:38,687 INFO L226 Difference]: Without dead ends: 74 [2022-04-14 20:08:38,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 20:08:38,689 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:38,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:08:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-14 20:08:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-14 20:08:38,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:38,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:38,698 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:38,699 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:38,704 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-14 20:08:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-14 20:08:38,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:38,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:38,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-14 20:08:38,709 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-14 20:08:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:38,713 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-14 20:08:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-14 20:08:38,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:38,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:38,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:38,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-14 20:08:38,718 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-14 20:08:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:38,718 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-14 20:08:38,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20:08:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-14 20:08:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 20:08:38,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:38,720 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:38,741 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 20:08:38,935 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 20:08:38,936 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1377643522, now seen corresponding path program 1 times [2022-04-14 20:08:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905452539] [2022-04-14 20:08:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:38,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:08:38,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629228782] [2022-04-14 20:08:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:38,957 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 20:08:38,977 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 20:08:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:39,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 20:08:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:39,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:39,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {1052#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1052#true} is VALID [2022-04-14 20:08:39,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {1052#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1052#true} is VALID [2022-04-14 20:08:39,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {1052#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1052#true} is VALID [2022-04-14 20:08:39,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#true} [102] assume_abort_if_notENTRY-->L12: 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] {1078#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 20:08:39,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1078#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [107] L12-->L12-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[] {1082#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 20:08:39,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1082#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 20:08:39,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1082#(not (= |assume_abort_if_not_#in~cond| 0))} {1052#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1089#(<= 1 main_~y~0)} is VALID [2022-04-14 20:08:39,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#(<= 1 main_~y~0)} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1089#(<= 1 main_~y~0)} is VALID [2022-04-14 20:08:39,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#(<= 1 main_~y~0)} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#(<= 1 main_~y~0)} is VALID [2022-04-14 20:08:39,270 INFO L272 TraceCheckUtils]: 13: Hoare triple {1089#(<= 1 main_~y~0)} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1052#true} is VALID [2022-04-14 20:08:39,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-14 20:08:39,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,273 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1052#true} {1089#(<= 1 main_~y~0)} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1089#(<= 1 main_~y~0)} is VALID [2022-04-14 20:08:39,273 INFO L272 TraceCheckUtils]: 18: Hoare triple {1089#(<= 1 main_~y~0)} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1052#true} is VALID [2022-04-14 20:08:39,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-14 20:08:39,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,275 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1052#true} {1089#(<= 1 main_~y~0)} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1089#(<= 1 main_~y~0)} is VALID [2022-04-14 20:08:39,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {1089#(<= 1 main_~y~0)} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1129#(<= 1 main_~r~0)} is VALID [2022-04-14 20:08:39,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {1129#(<= 1 main_~r~0)} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1129#(<= 1 main_~r~0)} is VALID [2022-04-14 20:08:39,277 INFO L272 TraceCheckUtils]: 25: Hoare triple {1129#(<= 1 main_~r~0)} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1052#true} is VALID [2022-04-14 20:08:39,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-14 20:08:39,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,285 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1052#true} {1129#(<= 1 main_~r~0)} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1129#(<= 1 main_~r~0)} is VALID [2022-04-14 20:08:39,285 INFO L272 TraceCheckUtils]: 30: Hoare triple {1129#(<= 1 main_~r~0)} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1052#true} is VALID [2022-04-14 20:08:39,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-14 20:08:39,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-14 20:08:39,286 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1052#true} {1129#(<= 1 main_~r~0)} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1129#(<= 1 main_~r~0)} is VALID [2022-04-14 20:08:39,287 INFO L272 TraceCheckUtils]: 35: Hoare triple {1129#(<= 1 main_~r~0)} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1166#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:39,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {1166#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1170#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:39,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {1170#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1053#false} is VALID [2022-04-14 20:08:39,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {1053#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#false} is VALID [2022-04-14 20:08:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 20:08:39,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:08:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:39,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905452539] [2022-04-14 20:08:39,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:08:39,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629228782] [2022-04-14 20:08:39,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629228782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:39,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:39,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 20:08:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054834999] [2022-04-14 20:08:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 39 [2022-04-14 20:08:39,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:39,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 20:08:39,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:39,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 20:08:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 20:08:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:08:39,330 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 20:08:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:39,613 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-14 20:08:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:08:39,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 39 [2022-04-14 20:08:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 20:08:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-14 20:08:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 20:08:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-14 20:08:39,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-14 20:08:39,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:39,654 INFO L225 Difference]: With dead ends: 71 [2022-04-14 20:08:39,654 INFO L226 Difference]: Without dead ends: 71 [2022-04-14 20:08:39,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-14 20:08:39,656 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:39,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:08:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-14 20:08:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-14 20:08:39,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:39,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:39,678 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:39,679 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:39,682 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-14 20:08:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-14 20:08:39,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:39,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:39,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-14 20:08:39,684 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-14 20:08:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:39,688 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-14 20:08:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-14 20:08:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:39,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:39,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-14 20:08:39,692 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-14 20:08:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:39,693 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-14 20:08:39,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 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 20:08:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-14 20:08:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 20:08:39,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:39,694 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:39,712 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 20:08:39,903 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 20:08:39,903 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1134631717, now seen corresponding path program 1 times [2022-04-14 20:08:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611455919] [2022-04-14 20:08:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:39,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:08:39,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579027200] [2022-04-14 20:08:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:39,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:39,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:39,931 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 20:08:39,941 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 20:08:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:39,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 20:08:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:40,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:40,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1466#true} is VALID [2022-04-14 20:08:40,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {1466#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1466#true} [102] assume_abort_if_notENTRY-->L12: 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] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1466#true} [107] L12-->L12-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[] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {1466#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1466#true} {1466#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {1466#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:40,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {1466#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,401 INFO L272 TraceCheckUtils]: 13: Hoare triple {1466#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:40,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:40,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,401 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1466#true} {1466#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:40,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {1466#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:40,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:40,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,402 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1466#true} {1466#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:40,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:40,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {1466#true} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,403 INFO L272 TraceCheckUtils]: 25: Hoare triple {1466#true} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:40,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:40,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:40,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:40,405 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1466#true} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-14 20:08:40,405 INFO L272 TraceCheckUtils]: 30: Hoare triple {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:40,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:40,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,406 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1466#true} {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-14 20:08:40,407 INFO L272 TraceCheckUtils]: 35: Hoare triple {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:40,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:40,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:40,408 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1466#true} {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-14 20:08:40,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-14 20:08:40,409 INFO L272 TraceCheckUtils]: 41: Hoare triple {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:40,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:40,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-14 20:08:40,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {1467#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-14 20:08:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 20:08:40,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:08:44,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {1467#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-14 20:08:44,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-14 20:08:44,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:44,923 INFO L272 TraceCheckUtils]: 41: Hoare triple {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:44,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-14 20:08:44,925 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1466#true} {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-14 20:08:44,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:44,926 INFO L272 TraceCheckUtils]: 35: Hoare triple {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:44,930 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1466#true} {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-14 20:08:44,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:44,931 INFO L272 TraceCheckUtils]: 30: Hoare triple {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:44,932 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1466#true} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-14 20:08:44,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:44,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:44,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:08:44,933 INFO L272 TraceCheckUtils]: 25: Hoare triple {1466#true} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:44,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {1466#true} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:44,934 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1466#true} {1466#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:44,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:44,934 INFO L272 TraceCheckUtils]: 18: Hoare triple {1466#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-14 20:08:44,935 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1466#true} {1466#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:44,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-14 20:08:44,935 INFO L272 TraceCheckUtils]: 13: Hoare triple {1466#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:44,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {1466#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {1466#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:44,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1466#true} {1466#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-14 20:08:44,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {1466#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {1466#true} [107] L12-->L12-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[] {1466#true} is VALID [2022-04-14 20:08:44,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {1466#true} [102] assume_abort_if_notENTRY-->L12: 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] {1466#true} is VALID [2022-04-14 20:08:44,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {1466#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-14 20:08:44,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-14 20:08:44,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1466#true} is VALID [2022-04-14 20:08:44,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-14 20:08:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 20:08:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:44,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611455919] [2022-04-14 20:08:44,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:08:44,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579027200] [2022-04-14 20:08:44,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579027200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:08:44,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:08:44,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 20:08:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396360024] [2022-04-14 20:08:44,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:08:44,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-14 20:08:44,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:44,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-14 20:08:44,985 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 20:08:44,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 20:08:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 20:08:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:08:44,986 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-14 20:08:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:45,401 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-14 20:08:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:08:45,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-14 20:08:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-14 20:08:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-14 20:08:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-14 20:08:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-14 20:08:45,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-14 20:08:45,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:45,471 INFO L225 Difference]: With dead ends: 75 [2022-04-14 20:08:45,471 INFO L226 Difference]: Without dead ends: 75 [2022-04-14 20:08:45,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-14 20:08:45,472 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:45,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 20:08:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-14 20:08:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-14 20:08:45,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:45,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:45,478 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:45,478 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:45,488 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-14 20:08:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-14 20:08:45,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:45,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:45,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-14 20:08:45,489 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-14 20:08:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:45,494 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-14 20:08:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-14 20:08:45,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:45,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:45,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:45,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:08:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-14 20:08:45,500 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-14 20:08:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:45,502 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-14 20:08:45,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-14 20:08:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-14 20:08:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-14 20:08:45,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:45,504 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:45,531 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 20:08:45,718 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 20:08:45,718 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 239949443, now seen corresponding path program 1 times [2022-04-14 20:08:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:45,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816390097] [2022-04-14 20:08:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:45,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:08:45,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119316357] [2022-04-14 20:08:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:45,733 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 20:08:45,747 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 20:08:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:45,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-14 20:08:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:45,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:46,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {2051#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {2051#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2051#true} is VALID [2022-04-14 20:08:46,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {2051#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2051#true} {2051#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {2051#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {2051#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2051#true} is VALID [2022-04-14 20:08:46,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {2051#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2051#true} is VALID [2022-04-14 20:08:46,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {2051#true} [102] assume_abort_if_notENTRY-->L12: 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] {2051#true} is VALID [2022-04-14 20:08:46,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {2051#true} [107] L12-->L12-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[] {2051#true} is VALID [2022-04-14 20:08:46,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {2051#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2051#true} {2051#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2051#true} is VALID [2022-04-14 20:08:46,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {2051#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,354 INFO L272 TraceCheckUtils]: 13: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2051#true} is VALID [2022-04-14 20:08:46,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-14 20:08:46,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,355 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2051#true} {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,355 INFO L272 TraceCheckUtils]: 18: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2051#true} is VALID [2022-04-14 20:08:46,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-14 20:08:46,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,356 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2051#true} {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,357 INFO L272 TraceCheckUtils]: 25: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2051#true} is VALID [2022-04-14 20:08:46,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-14 20:08:46,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,364 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2051#true} {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,364 INFO L272 TraceCheckUtils]: 30: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2051#true} is VALID [2022-04-14 20:08:46,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-14 20:08:46,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,369 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2051#true} {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,370 INFO L272 TraceCheckUtils]: 35: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2051#true} is VALID [2022-04-14 20:08:46,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-14 20:08:46,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-14 20:08:46,373 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2051#true} {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2178#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:08:46,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {2178#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-14 20:08:46,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-14 20:08:46,376 INFO L272 TraceCheckUtils]: 43: Hoare triple {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2051#true} is VALID [2022-04-14 20:08:46,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2192#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:46,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {2192#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:46,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:46,378 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2203#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-14 20:08:46,379 INFO L272 TraceCheckUtils]: 48: Hoare triple {2203#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:46,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {2207#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:46,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {2211#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2052#false} is VALID [2022-04-14 20:08:46,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {2052#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2052#false} is VALID [2022-04-14 20:08:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-14 20:08:46,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:09:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:09:42,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816390097] [2022-04-14 20:09:42,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:09:42,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119316357] [2022-04-14 20:09:42,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119316357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:09:42,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 20:09:42,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-14 20:09:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715311124] [2022-04-14 20:09:42,194 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 20:09:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-14 20:09:42,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:09:42,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-14 20:09:42,231 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 20:09:42,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 20:09:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:09:42,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 20:09:42,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-14 20:09:42,232 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-14 20:09:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:09:43,056 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-14 20:09:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 20:09:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-14 20:09:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:09:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-14 20:09:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-14 20:09:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-14 20:09:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-14 20:09:43,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-14 20:09:43,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:09:43,145 INFO L225 Difference]: With dead ends: 92 [2022-04-14 20:09:43,145 INFO L226 Difference]: Without dead ends: 82 [2022-04-14 20:09:43,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-14 20:09:43,146 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 20:09:43,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 145 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 20:09:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-14 20:09:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-14 20:09:43,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:09:43,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:09:43,152 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:09:43,153 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:09:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:09:43,156 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-14 20:09:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-14 20:09:43,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:09:43,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:09:43,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-14 20:09:43,157 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-14 20:09:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:09:43,161 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-14 20:09:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-14 20:09:43,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:09:43,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:09:43,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:09:43,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:09:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-14 20:09:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-14 20:09:43,164 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 52 [2022-04-14 20:09:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:09:43,165 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-14 20:09:43,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-14 20:09:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-14 20:09:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 20:09:43,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:09:43,166 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:09:43,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 20:09:43,389 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 20:09:43,390 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:09:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:09:43,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1565775829, now seen corresponding path program 1 times [2022-04-14 20:09:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:09:43,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986773400] [2022-04-14 20:09:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:09:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:09:43,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:09:43,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941807472] [2022-04-14 20:09:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:09:43,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:09:43,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:09:43,406 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 20:09:43,410 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 20:09:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:09:43,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 20:09:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:09:43,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:09:44,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {2651#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {2651#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2651#true} is VALID [2022-04-14 20:09:44,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {2651#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2651#true} {2651#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {2651#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {2651#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {2651#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-14 20:09:44,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {2651#true} [102] assume_abort_if_notENTRY-->L12: 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] {2651#true} is VALID [2022-04-14 20:09:44,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {2651#true} [107] L12-->L12-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[] {2651#true} is VALID [2022-04-14 20:09:44,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {2651#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2651#true} {2651#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-14 20:09:44,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,116 INFO L272 TraceCheckUtils]: 13: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,118 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2651#true} {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,118 INFO L272 TraceCheckUtils]: 18: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,119 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2651#true} {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,120 INFO L272 TraceCheckUtils]: 25: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,122 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2651#true} {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,122 INFO L272 TraceCheckUtils]: 30: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,123 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2651#true} {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,123 INFO L272 TraceCheckUtils]: 35: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,124 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2651#true} {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,125 INFO L272 TraceCheckUtils]: 41: Hoare triple {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,126 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2651#true} {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L53-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:09:44,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [131] L53-1-->L45-2: Formula: (and (= v_main_~a~0_5 (* v_main_~a~0_6 2)) (= v_main_~b~0_6 (* v_main_~b~0_7 2))) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-14 20:09:44,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-14 20:09:44,128 INFO L272 TraceCheckUtils]: 48: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,129 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2651#true} {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-14 20:09:44,129 INFO L272 TraceCheckUtils]: 53: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,130 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2651#true} {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-14 20:09:44,130 INFO L272 TraceCheckUtils]: 58: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,131 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2651#true} {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-14 20:09:44,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2849#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-14 20:09:44,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {2849#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-14 20:09:44,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-14 20:09:44,134 INFO L272 TraceCheckUtils]: 66: Hoare triple {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,135 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2651#true} {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-14 20:09:44,136 INFO L272 TraceCheckUtils]: 71: Hoare triple {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:09:44,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:09:44,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {2879#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-14 20:09:44,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {2652#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-14 20:09:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-14 20:09:44,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:09:44,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {2652#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-14 20:09:44,835 INFO L290 TraceCheckUtils]: 73: Hoare triple {2879#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-14 20:09:44,835 INFO L290 TraceCheckUtils]: 72: Hoare triple {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:09:44,836 INFO L272 TraceCheckUtils]: 71: Hoare triple {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:09:44,837 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2651#true} {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-14 20:09:44,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,837 INFO L272 TraceCheckUtils]: 66: Hoare triple {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-14 20:09:44,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {2917#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-14 20:09:44,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2917#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-14 20:09:44,846 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2651#true} {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-14 20:09:44,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,847 INFO L272 TraceCheckUtils]: 58: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,847 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2651#true} {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-14 20:09:44,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,848 INFO L272 TraceCheckUtils]: 53: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,849 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2651#true} {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-14 20:09:44,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,852 INFO L272 TraceCheckUtils]: 48: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-14 20:09:44,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [131] L53-1-->L45-2: Formula: (and (= v_main_~a~0_5 (* v_main_~a~0_6 2)) (= v_main_~b~0_6 (* v_main_~b~0_7 2))) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-14 20:09:44,863 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2651#true} {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [141] __VERIFIER_assertEXIT-->L53-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,864 INFO L272 TraceCheckUtils]: 41: Hoare triple {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,868 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2651#true} {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,869 INFO L272 TraceCheckUtils]: 35: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,869 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2651#true} {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,870 INFO L272 TraceCheckUtils]: 30: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,870 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2651#true} {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,871 INFO L272 TraceCheckUtils]: 25: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-14 20:09:44,873 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2651#true} {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-14 20:09:44,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,874 INFO L272 TraceCheckUtils]: 18: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-14 20:09:44,874 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2651#true} {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-14 20:09:44,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-14 20:09:44,875 INFO L272 TraceCheckUtils]: 13: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-14 20:09:44,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-14 20:09:44,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2651#true} {2651#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-14 20:09:44,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {2651#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {2651#true} [107] L12-->L12-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[] {2651#true} is VALID [2022-04-14 20:09:44,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {2651#true} [102] assume_abort_if_notENTRY-->L12: 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] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {2651#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {2651#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {2651#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2651#true} {2651#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {2651#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {2651#true} [96] 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_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2651#true} is VALID [2022-04-14 20:09:44,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {2651#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-14 20:09:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-14 20:09:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:09:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986773400] [2022-04-14 20:09:44,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:09:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941807472] [2022-04-14 20:09:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941807472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:09:44,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:09:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-14 20:09:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66995340] [2022-04-14 20:09:44,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:09:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-14 20:09:44,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:09:44,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-14 20:09:44,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:09:44,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-14 20:09:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:09:44,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-14 20:09:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-04-14 20:09:44,980 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-14 20:09:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:09:47,270 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2022-04-14 20:09:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 20:09:47,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-14 20:09:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:09:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-14 20:09:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-14 20:09:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-14 20:09:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-14 20:09:47,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2022-04-14 20:09:47,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:09:47,421 INFO L225 Difference]: With dead ends: 115 [2022-04-14 20:09:47,421 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:09:47,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-14 20:09:47,422 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:09:47,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 164 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 20:09:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:09:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:09:47,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:09:47,423 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 20:09:47,423 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 20:09:47,423 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 20:09:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:09:47,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:09:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:09:47,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:09:47,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:09:47,424 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 20:09:47,424 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 20:09:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:09:47,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:09:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:09:47,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:09:47,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:09:47,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:09:47,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:09:47,425 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 20:09:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:09:47,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-14 20:09:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:09:47,425 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:09:47,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-14 20:09:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:09:47,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:09:47,428 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:09:47,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 20:09:47,629 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 20:09:47,632 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:09:47,633 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:09:47,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:09:47 BasicIcfg [2022-04-14 20:09:47,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:09:47,636 INFO L158 Benchmark]: Toolchain (without parser) took 72539.77ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 122.5MB in the beginning and 70.7MB in the end (delta: 51.7MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2022-04-14 20:09:47,637 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:09:47,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.83ms. Allocated memory is still 173.0MB. Free memory was 122.2MB in the beginning and 149.6MB in the end (delta: -27.4MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-14 20:09:47,637 INFO L158 Benchmark]: Boogie Preprocessor took 26.75ms. Allocated memory is still 173.0MB. Free memory was 149.6MB in the beginning and 147.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:09:47,638 INFO L158 Benchmark]: RCFGBuilder took 365.89ms. Allocated memory is still 173.0MB. Free memory was 147.9MB in the beginning and 135.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 20:09:47,638 INFO L158 Benchmark]: IcfgTransformer took 52.72ms. Allocated memory is still 173.0MB. Free memory was 135.3MB in the beginning and 133.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:09:47,638 INFO L158 Benchmark]: TraceAbstraction took 71841.04ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 133.4MB in the beginning and 70.7MB in the end (delta: 62.6MB). Peak memory consumption was 98.1MB. Max. memory is 8.0GB. [2022-04-14 20:09:47,639 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.13ms. Allocated memory is still 173.0MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.83ms. Allocated memory is still 173.0MB. Free memory was 122.2MB in the beginning and 149.6MB in the end (delta: -27.4MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.75ms. Allocated memory is still 173.0MB. Free memory was 149.6MB in the beginning and 147.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 365.89ms. Allocated memory is still 173.0MB. Free memory was 147.9MB in the beginning and 135.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 52.72ms. Allocated memory is still 173.0MB. Free memory was 135.3MB in the beginning and 133.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 71841.04ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 133.4MB in the beginning and 70.7MB in the end (delta: 62.6MB). Peak memory consumption was 98.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.8s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 979 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 703 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1023 IncrementalHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 276 mSDtfsCounter, 1023 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 373 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 63.7s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1447 SizeOfPredicates, 20 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 602/633 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 20:09:47,666 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...