/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 20:38:53,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 20:38:53,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 20:38:53,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 20:38:53,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 20:38:53,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 20:38:53,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 20:38:53,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 20:38:53,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 20:38:53,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 20:38:53,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 20:38:53,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 20:38:53,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 20:38:53,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 20:38:53,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 20:38:53,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 20:38:53,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 20:38:53,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 20:38:53,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 20:38:53,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 20:38:53,899 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 20:38:53,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 20:38:53,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 20:38:53,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 20:38:53,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 20:38:53,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 20:38:53,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 20:38:53,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 20:38:53,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 20:38:53,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 20:38:53,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 20:38:53,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 20:38:53,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 20:38:53,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 20:38:53,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 20:38:53,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 20:38:53,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 20:38:53,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 20:38:53,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 20:38:53,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 20:38:53,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 20:38:53,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 20:38:53,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 20:38:53,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 20:38:53,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 20:38:53,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 20:38:53,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 20:38:53,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 20:38:53,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 20:38:53,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 20:38:53,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 20:38:53,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 20:38:53,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 20:38:53,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 20:38:53,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 20:38:53,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 20:38:53,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 20:38:53,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 20:38:53,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 20:38:53,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 20:38:53,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 20:38:53,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:38:53,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 20:38:53,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 20:38:53,933 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 20:38:53,933 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-07 20:38:54,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 20:38:54,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 20:38:54,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 20:38:54,167 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 20:38:54,168 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 20:38:54,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c [2022-04-07 20:38:54,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67b3c6b4/c424d83513044edca8d8bdebf2cd81ab/FLAG18a05ba8d [2022-04-07 20:38:54,578 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 20:38:54,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c [2022-04-07 20:38:54,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67b3c6b4/c424d83513044edca8d8bdebf2cd81ab/FLAG18a05ba8d [2022-04-07 20:38:54,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67b3c6b4/c424d83513044edca8d8bdebf2cd81ab [2022-04-07 20:38:54,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 20:38:54,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 20:38:54,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 20:38:54,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 20:38:54,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 20:38:54,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:38:54" (1/1) ... [2022-04-07 20:38:54,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10aa896b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:54, skipping insertion in model container [2022-04-07 20:38:54,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:38:54" (1/1) ... [2022-04-07 20:38:55,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 20:38:55,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 20:38:55,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c[524,537] [2022-04-07 20:38:55,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:38:55,211 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 20:38:55,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c[524,537] [2022-04-07 20:38:55,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:38:55,237 INFO L208 MainTranslator]: Completed translation [2022-04-07 20:38:55,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55 WrapperNode [2022-04-07 20:38:55,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 20:38:55,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 20:38:55,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 20:38:55,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 20:38:55,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 20:38:55,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 20:38:55,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 20:38:55,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 20:38:55,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:38:55,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:38:55,302 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-07 20:38:55,319 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-07 20:38:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 20:38:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 20:38:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 20:38:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 20:38:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 20:38:55,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 20:38:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 20:38:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 20:38:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 20:38:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 20:38:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 20:38:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 20:38:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 20:38:55,393 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 20:38:55,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 20:38:55,554 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 20:38:55,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 20:38:55,561 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 20:38:55,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:38:55 BoogieIcfgContainer [2022-04-07 20:38:55,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 20:38:55,563 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 20:38:55,563 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 20:38:55,564 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 20:38:55,566 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:38:55" (1/1) ... [2022-04-07 20:38:55,568 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 20:38:55,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:38:55 BasicIcfg [2022-04-07 20:38:55,602 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 20:38:55,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 20:38:55,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 20:38:55,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 20:38:55,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:38:54" (1/4) ... [2022-04-07 20:38:55,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111d27b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:38:55, skipping insertion in model container [2022-04-07 20:38:55,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:38:55" (2/4) ... [2022-04-07 20:38:55,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111d27b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:38:55, skipping insertion in model container [2022-04-07 20:38:55,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:38:55" (3/4) ... [2022-04-07 20:38:55,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111d27b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:38:55, skipping insertion in model container [2022-04-07 20:38:55,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:38:55" (4/4) ... [2022-04-07 20:38:55,608 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound100.cJordan [2022-04-07 20:38:55,612 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 20:38:55,612 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 20:38:55,645 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 20:38:55,651 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-07 20:38:55,651 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 20:38:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 20:38:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 20:38:55,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:38:55,674 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:38:55,674 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:38:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:38:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 574541465, now seen corresponding path program 1 times [2022-04-07 20:38:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:38:55,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481576317] [2022-04-07 20:38:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:38:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:38:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 20:38:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:55,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-07 20:38:55,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 20:38:55,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 20:38:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 20:38:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:55,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: 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] {37#true} is VALID [2022-04-07 20:38:55,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 20:38:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 20:38:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:55,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: 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] {37#true} is VALID [2022-04-07 20:38:55,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 20:38:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 20:38:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:55,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: 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] {37#true} is VALID [2022-04-07 20:38:55,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 20:38:55,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 20:38:55,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-07 20:38:55,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 20:38:55,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 20:38:55,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 20:38:55,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {37#true} is VALID [2022-04-07 20:38:55,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-07 20:38:55,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: 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] {37#true} is VALID [2022-04-07 20:38:55,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 20:38:55,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {38#false} is VALID [2022-04-07 20:38:55,912 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-07 20:38:55,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: 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] {37#true} is VALID [2022-04-07 20:38:55,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,913 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 20:38:55,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-07 20:38:55,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [94] assume_abort_if_notENTRY-->L9: 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] {37#true} is VALID [2022-04-07 20:38:55,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [96] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 20:38:55,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {38#false} is VALID [2022-04-07 20:38:55,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} [101] L47-2-->L34-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,924 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {38#false} is VALID [2022-04-07 20:38:55,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#false} is VALID [2022-04-07 20:38:55,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 20:38:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 20:38:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:38:55,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481576317] [2022-04-07 20:38:55,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481576317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:38:55,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:38:55,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 20:38:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237190423] [2022-04-07 20:38:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:38:55,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 20:38:55,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:38:55,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 20:38:55,962 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-07 20:38:55,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 20:38:55,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:38:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 20:38:55,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:38:55,992 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 20:38:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:38:56,118 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-07 20:38:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 20:38:56,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 20:38:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:38:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 20:38:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-07 20:38:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 20:38:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-07 20:38:56,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-04-07 20:38:56,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:38:56,188 INFO L225 Difference]: With dead ends: 34 [2022-04-07 20:38:56,188 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 20:38:56,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:38:56,192 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:38:56,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:38:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 20:38:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 20:38:56,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:38:56,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:56,264 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:56,265 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:38:56,279 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-07 20:38:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-07 20:38:56,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:38:56,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:38:56,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 20:38:56,283 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 20:38:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:38:56,287 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-07 20:38:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-07 20:38:56,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:38:56,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:38:56,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:38:56,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:38:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-07 20:38:56,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-07 20:38:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:38:56,292 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-07 20:38:56,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 20:38:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-07 20:38:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 20:38:56,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:38:56,294 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:38:56,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 20:38:56,294 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:38:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:38:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2145419015, now seen corresponding path program 1 times [2022-04-07 20:38:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:38:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521108491] [2022-04-07 20:38:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:38:56,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:38:56,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:38:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659211431] [2022-04-07 20:38:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:38:56,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:38:56,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:38:56,321 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-07 20:38:56,329 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-07 20:38:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:56,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 20:38:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:56,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:38:56,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {178#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:56,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {178#true} is VALID [2022-04-07 20:38:56,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:56,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:56,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {178#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:56,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {178#true} is VALID [2022-04-07 20:38:56,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {178#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:56,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: 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] {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:38:56,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-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[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:38:56,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:38:56,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {208#(not (= |assume_abort_if_not_#in~cond| 0))} {178#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:38:56,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:38:56,912 INFO L272 TraceCheckUtils]: 12: Hoare triple {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:56,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: 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] {178#true} is VALID [2022-04-07 20:38:56,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {178#true} [97] L9-->L9-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[] {178#true} is VALID [2022-04-07 20:38:56,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {178#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:56,916 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {178#true} {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:38:56,916 INFO L272 TraceCheckUtils]: 17: Hoare triple {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:56,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: 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] {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:38:56,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-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[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:38:56,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:38:56,918 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {208#(not (= |assume_abort_if_not_#in~cond| 0))} {215#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {249#(and (<= 0 main_~x~0) (<= main_~x~0 100) (<= 1 main_~y~0))} is VALID [2022-04-07 20:38:56,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {249#(and (<= 0 main_~x~0) (<= main_~x~0 100) (<= 1 main_~y~0))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {253#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 20:38:56,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {253#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 20:38:56,921 INFO L272 TraceCheckUtils]: 24: Hoare triple {253#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:38:56,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {260#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:38:56,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {264#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-07 20:38:56,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {179#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-07 20:38:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 20:38:56,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:38:57,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {179#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-07 20:38:57,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {264#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-07 20:38:57,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {260#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:38:57,235 INFO L272 TraceCheckUtils]: 24: Hoare triple {280#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:38:57,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {280#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {280#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-07 20:38:57,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {178#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {280#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-07 20:38:57,237 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {178#true} {178#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:57,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {178#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {178#true} [97] L9-->L9-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[] {178#true} is VALID [2022-04-07 20:38:57,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: 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] {178#true} is VALID [2022-04-07 20:38:57,238 INFO L272 TraceCheckUtils]: 17: Hoare triple {178#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:57,238 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {178#true} {178#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:57,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {178#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {178#true} [97] L9-->L9-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[] {178#true} is VALID [2022-04-07 20:38:57,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: 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] {178#true} is VALID [2022-04-07 20:38:57,239 INFO L272 TraceCheckUtils]: 12: Hoare triple {178#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:57,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {178#true} is VALID [2022-04-07 20:38:57,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {178#true} {178#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:57,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#true} [97] L9-->L9-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[] {178#true} is VALID [2022-04-07 20:38:57,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#true} [94] assume_abort_if_notENTRY-->L9: 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] {178#true} is VALID [2022-04-07 20:38:57,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {178#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {178#true} is VALID [2022-04-07 20:38:57,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {178#true} is VALID [2022-04-07 20:38:57,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {178#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {178#true} is VALID [2022-04-07 20:38:57,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {178#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-07 20:38:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 20:38:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:38:57,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521108491] [2022-04-07 20:38:57,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:38:57,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659211431] [2022-04-07 20:38:57,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659211431] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 20:38:57,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 20:38:57,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-07 20:38:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625808354] [2022-04-07 20:38:57,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:38:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 20:38:57,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:38:57,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 20:38:57,264 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-07 20:38:57,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:38:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:38:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:38:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 20:38:57,266 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 20:38:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:38:57,610 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 20:38:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:38:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 20:38:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:38:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 20:38:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-07 20:38:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 20:38:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-07 20:38:57,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-07 20:38:57,686 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-07 20:38:57,687 INFO L225 Difference]: With dead ends: 33 [2022-04-07 20:38:57,687 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 20:38:57,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 20:38:57,689 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 20:38:57,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 20:38:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 20:38:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 20:38:57,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:38:57,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:57,698 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:57,699 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:38:57,703 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 20:38:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 20:38:57,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:38:57,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:38:57,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-07 20:38:57,708 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-07 20:38:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:38:57,712 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 20:38:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 20:38:57,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:38:57,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:38:57,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:38:57,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:38:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:38:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-07 20:38:57,715 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-04-07 20:38:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:38:57,716 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-07 20:38:57,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 20:38:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 20:38:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 20:38:57,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:38:57,717 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:38:57,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 20:38:57,939 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-07 20:38:57,940 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:38:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:38:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash -257170002, now seen corresponding path program 1 times [2022-04-07 20:38:57,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:38:57,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181480479] [2022-04-07 20:38:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:38:57,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:38:57,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:38:57,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994003271] [2022-04-07 20:38:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:38:57,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:38:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:38:57,962 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-07 20:38:57,971 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-07 20:38:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:58,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 20:38:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:38:58,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:39:08,280 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 20:39:08,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:08,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {489#true} is VALID [2022-04-07 20:39:08,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:08,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:08,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:08,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {489#true} is VALID [2022-04-07 20:39:08,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {489#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:08,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#true} [94] assume_abort_if_notENTRY-->L9: 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] {489#true} is VALID [2022-04-07 20:39:08,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {489#true} [97] L9-->L9-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[] {489#true} is VALID [2022-04-07 20:39:08,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:08,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {489#true} {489#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:08,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {489#true} is VALID [2022-04-07 20:39:08,859 INFO L272 TraceCheckUtils]: 12: Hoare triple {489#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:08,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#true} [94] assume_abort_if_notENTRY-->L9: 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] {489#true} is VALID [2022-04-07 20:39:08,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#true} [97] L9-->L9-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[] {489#true} is VALID [2022-04-07 20:39:08,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:08,859 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {489#true} {489#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:08,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {489#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:08,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#true} [94] assume_abort_if_notENTRY-->L9: 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] {548#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:39:08,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {548#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-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[] {552#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:08,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {552#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:08,863 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {552#(not (= |assume_abort_if_not_#in~cond| 0))} {489#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {559#(<= 1 main_~y~0)} is VALID [2022-04-07 20:39:08,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {559#(<= 1 main_~y~0)} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {563#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-07 20:39:08,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {563#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-07 20:39:08,865 INFO L272 TraceCheckUtils]: 24: Hoare triple {563#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {489#true} is VALID [2022-04-07 20:39:08,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {489#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {573#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:39:08,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {573#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [112] L12-->L12-2: Formula: (not (= 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[] {577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:39:08,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {577#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:39:10,869 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {577#(not (= |__VERIFIER_assert_#in~cond| 0))} {563#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {584#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-07 20:39:10,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {584#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {588#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-07 20:39:10,871 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:39:10,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {592#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:39:10,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {596#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-07 20:39:10,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {490#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-07 20:39:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 20:39:10,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:39:25,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {490#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-07 20:39:25,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {596#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-07 20:39:25,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {592#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:39:25,367 INFO L272 TraceCheckUtils]: 30: Hoare triple {612#(= main_~q~0 (* main_~y~0 main_~x~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:39:25,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {616#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {612#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-07 20:39:25,370 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {577#(not (= |__VERIFIER_assert_#in~cond| 0))} {489#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {616#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-07 20:39:25,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {577#(not (= |__VERIFIER_assert_#in~cond| 0))} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:39:25,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {629#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [112] L12-->L12-2: Formula: (not (= 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[] {577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:39:25,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {489#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {629#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 20:39:25,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {489#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {489#true} is VALID [2022-04-07 20:39:25,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {489#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {489#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {489#true} is VALID [2022-04-07 20:39:25,372 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {489#true} {489#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {489#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {489#true} [97] L9-->L9-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[] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#true} [94] assume_abort_if_notENTRY-->L9: 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] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {489#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {489#true} {489#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#true} [97] L9-->L9-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[] {489#true} is VALID [2022-04-07 20:39:25,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#true} [94] assume_abort_if_notENTRY-->L9: 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] {489#true} is VALID [2022-04-07 20:39:25,374 INFO L272 TraceCheckUtils]: 12: Hoare triple {489#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:25,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {489#true} is VALID [2022-04-07 20:39:25,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {489#true} {489#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:25,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {489#true} [97] L9-->L9-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[] {489#true} is VALID [2022-04-07 20:39:25,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#true} [94] assume_abort_if_notENTRY-->L9: 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] {489#true} is VALID [2022-04-07 20:39:25,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {489#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {489#true} is VALID [2022-04-07 20:39:25,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {489#true} is VALID [2022-04-07 20:39:25,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {489#true} is VALID [2022-04-07 20:39:25,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-07 20:39:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 20:39:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:39:25,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181480479] [2022-04-07 20:39:25,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:39:25,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994003271] [2022-04-07 20:39:25,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994003271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:39:25,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:39:25,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-07 20:39:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118484692] [2022-04-07 20:39:25,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:39:25,378 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-07 20:39:25,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:39:25,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 20:39:27,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 20:39:27,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 20:39:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:39:27,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 20:39:27,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 20:39:27,422 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 20:39:30,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 20:39:37,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 20:39:39,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 20:39:41,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 20:39:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:41,429 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-04-07 20:39:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 20:39:41,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-07 20:39:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:39:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 20:39:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-07 20:39:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 20:39:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-07 20:39:41,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-07 20:39:41,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:39:41,494 INFO L225 Difference]: With dead ends: 49 [2022-04-07 20:39:41,495 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 20:39:41,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-07 20:39:41,496 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-04-07 20:39:41,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 168 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 296 Invalid, 3 Unknown, 0 Unchecked, 9.5s Time] [2022-04-07 20:39:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 20:39:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-07 20:39:41,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:39:41,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:41,501 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:41,501 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:41,504 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-07 20:39:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-07 20:39:41,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:41,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:39:41,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-07 20:39:41,505 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-07 20:39:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:41,511 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-07 20:39:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-07 20:39:41,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:41,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:39:41,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:39:41,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:39:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-07 20:39:41,520 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 34 [2022-04-07 20:39:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:39:41,520 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-07 20:39:41,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 20:39:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-07 20:39:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-07 20:39:41,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:39:41,522 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:39:41,539 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-07 20:39:41,723 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-07 20:39:41,723 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:39:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:39:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1300735059, now seen corresponding path program 1 times [2022-04-07 20:39:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:39:41,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529598009] [2022-04-07 20:39:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:39:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:39:41,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:39:41,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386486992] [2022-04-07 20:39:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:39:41,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:39:41,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:39:41,755 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-07 20:39:41,756 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-07 20:39:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:39:41,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 20:39:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:39:41,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:39:42,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {895#true} is VALID [2022-04-07 20:39:42,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {895#true} is VALID [2022-04-07 20:39:42,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {895#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {895#true} is VALID [2022-04-07 20:39:42,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#true} [94] assume_abort_if_notENTRY-->L9: 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] {921#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:39:42,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {921#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-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[] {925#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:42,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {925#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {925#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:42,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {925#(not (= |assume_abort_if_not_#in~cond| 0))} {895#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:39:42,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:39:42,258 INFO L272 TraceCheckUtils]: 12: Hoare triple {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {895#true} is VALID [2022-04-07 20:39:42,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#true} [94] assume_abort_if_notENTRY-->L9: 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] {895#true} is VALID [2022-04-07 20:39:42,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} [97] L9-->L9-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[] {895#true} is VALID [2022-04-07 20:39:42,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,258 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {895#true} {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:39:42,259 INFO L272 TraceCheckUtils]: 17: Hoare triple {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {895#true} is VALID [2022-04-07 20:39:42,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#true} [94] assume_abort_if_notENTRY-->L9: 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] {895#true} is VALID [2022-04-07 20:39:42,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {895#true} [97] L9-->L9-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[] {895#true} is VALID [2022-04-07 20:39:42,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {895#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,260 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {895#true} {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-07 20:39:42,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {932#(and (<= 0 main_~x~0) (<= main_~x~0 100))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {969#(<= 0 main_~a~0)} is VALID [2022-04-07 20:39:42,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#(<= 0 main_~a~0)} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#(<= 0 main_~a~0)} is VALID [2022-04-07 20:39:42,261 INFO L272 TraceCheckUtils]: 24: Hoare triple {969#(<= 0 main_~a~0)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {895#true} is VALID [2022-04-07 20:39:42,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {895#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {895#true} is VALID [2022-04-07 20:39:42,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {895#true} [112] L12-->L12-2: Formula: (not (= 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[] {895#true} is VALID [2022-04-07 20:39:42,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {895#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,263 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {895#true} {969#(<= 0 main_~a~0)} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {969#(<= 0 main_~a~0)} is VALID [2022-04-07 20:39:42,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {969#(<= 0 main_~a~0)} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:42,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [113] L40-->L47-2: Formula: (let ((.cse5 (mod v_main_~a~0_2 2)) (.cse1 (mod v_main_~b~0_2 2))) (let ((.cse0 (and (not (= .cse1 0)) (< v_main_~b~0_2 0))) (.cse3 (and (not (= .cse5 0)) (< v_main_~a~0_2 0)))) (and (= v_main_~p~0_1 (* v_main_~p~0_2 4)) (= (ite .cse0 (+ (- 2) .cse1) .cse1) 0) (= v_main_~b~0_1 (let ((.cse2 (div v_main_~b~0_2 2))) (ite .cse0 (+ .cse2 1) .cse2))) (= v_main_~a~0_1 (let ((.cse4 (div v_main_~a~0_2 2))) (ite .cse3 (+ .cse4 1) .cse4))) (= 0 (ite .cse3 (+ .cse5 (- 2)) .cse5))))) InVars {main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~b~0, main_~p~0, main_~a~0] {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:42,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:42,271 INFO L272 TraceCheckUtils]: 32: Hoare triple {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {895#true} is VALID [2022-04-07 20:39:42,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {895#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {895#true} is VALID [2022-04-07 20:39:42,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {895#true} [112] L12-->L12-2: Formula: (not (= 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[] {895#true} is VALID [2022-04-07 20:39:42,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:42,272 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {895#true} {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:42,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {991#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:42,272 INFO L272 TraceCheckUtils]: 38: Hoare triple {896#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {896#false} is VALID [2022-04-07 20:39:42,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {896#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {896#false} is VALID [2022-04-07 20:39:42,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {896#false} [112] L12-->L12-2: Formula: (not (= 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[] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {896#false} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {896#false} {896#false} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L272 TraceCheckUtils]: 43: Hoare triple {896#false} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {896#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {896#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {896#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 20:39:42,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:39:43,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {896#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:43,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {896#false} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:43,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {896#false} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {896#false} is VALID [2022-04-07 20:39:43,365 INFO L272 TraceCheckUtils]: 43: Hoare triple {896#false} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {896#false} is VALID [2022-04-07 20:39:43,365 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {895#true} {896#false} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {896#false} is VALID [2022-04-07 20:39:43,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {895#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {895#true} [112] L12-->L12-2: Formula: (not (= 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[] {895#true} is VALID [2022-04-07 20:39:43,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {895#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {895#true} is VALID [2022-04-07 20:39:43,366 INFO L272 TraceCheckUtils]: 38: Hoare triple {896#false} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {895#true} is VALID [2022-04-07 20:39:43,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {896#false} is VALID [2022-04-07 20:39:43,369 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {895#true} {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:43,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {895#true} [112] L12-->L12-2: Formula: (not (= 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[] {895#true} is VALID [2022-04-07 20:39:43,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {895#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {895#true} is VALID [2022-04-07 20:39:43,369 INFO L272 TraceCheckUtils]: 32: Hoare triple {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {895#true} is VALID [2022-04-07 20:39:43,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:43,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} [113] L40-->L47-2: Formula: (let ((.cse5 (mod v_main_~a~0_2 2)) (.cse1 (mod v_main_~b~0_2 2))) (let ((.cse0 (and (not (= .cse1 0)) (< v_main_~b~0_2 0))) (.cse3 (and (not (= .cse5 0)) (< v_main_~a~0_2 0)))) (and (= v_main_~p~0_1 (* v_main_~p~0_2 4)) (= (ite .cse0 (+ (- 2) .cse1) .cse1) 0) (= v_main_~b~0_1 (let ((.cse2 (div v_main_~b~0_2 2))) (ite .cse0 (+ .cse2 1) .cse2))) (= v_main_~a~0_1 (let ((.cse4 (div v_main_~a~0_2 2))) (ite .cse3 (+ .cse4 1) .cse4))) (= 0 (ite .cse3 (+ .cse5 (- 2)) .cse5))))) InVars {main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~b~0, main_~p~0, main_~a~0] {1070#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 20:39:43,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1092#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-07 20:39:43,373 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {895#true} {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-07 20:39:43,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {895#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {895#true} [112] L12-->L12-2: Formula: (not (= 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[] {895#true} is VALID [2022-04-07 20:39:43,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {895#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {895#true} is VALID [2022-04-07 20:39:43,373 INFO L272 TraceCheckUtils]: 24: Hoare triple {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {895#true} is VALID [2022-04-07 20:39:43,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-07 20:39:43,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1096#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-07 20:39:43,375 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {895#true} {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 20:39:43,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {895#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {895#true} [97] L9-->L9-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[] {895#true} is VALID [2022-04-07 20:39:43,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#true} [94] assume_abort_if_notENTRY-->L9: 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] {895#true} is VALID [2022-04-07 20:39:43,376 INFO L272 TraceCheckUtils]: 17: Hoare triple {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {895#true} is VALID [2022-04-07 20:39:43,377 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {895#true} {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 20:39:43,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} [97] L9-->L9-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[] {895#true} is VALID [2022-04-07 20:39:43,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#true} [94] assume_abort_if_notENTRY-->L9: 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] {895#true} is VALID [2022-04-07 20:39:43,377 INFO L272 TraceCheckUtils]: 12: Hoare triple {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {895#true} is VALID [2022-04-07 20:39:43,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 20:39:43,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {925#(not (= |assume_abort_if_not_#in~cond| 0))} {895#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1118#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 20:39:43,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {925#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {925#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:43,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {1164#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [97] L9-->L9-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[] {925#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:43,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#true} [94] assume_abort_if_notENTRY-->L9: 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] {1164#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 20:39:43,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {895#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {895#true} is VALID [2022-04-07 20:39:43,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {895#true} is VALID [2022-04-07 20:39:43,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {895#true} is VALID [2022-04-07 20:39:43,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#true} is VALID [2022-04-07 20:39:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 20:39:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:39:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529598009] [2022-04-07 20:39:43,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:39:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386486992] [2022-04-07 20:39:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386486992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:39:43,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:39:43,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-04-07 20:39:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999122569] [2022-04-07 20:39:43,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:39:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-07 20:39:43,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:39:43,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 20:39:43,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:39:43,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 20:39:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:39:43,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 20:39:43,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 20:39:43,439 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 20:39:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:43,861 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 20:39:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 20:39:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-07 20:39:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:39:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 20:39:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-07 20:39:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 20:39:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-07 20:39:43,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-07 20:39:43,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:39:43,900 INFO L225 Difference]: With dead ends: 41 [2022-04-07 20:39:43,900 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 20:39:43,900 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-07 20:39:43,902 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 20:39:43,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 155 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 20:39:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 20:39:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-07 20:39:43,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:39:43,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:43,906 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:43,906 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:43,908 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 20:39:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 20:39:43,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:43,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:39:43,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-07 20:39:43,909 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-07 20:39:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:43,911 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 20:39:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 20:39:43,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:43,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:39:43,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:39:43,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:39:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:39:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-07 20:39:43,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 47 [2022-04-07 20:39:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:39:43,914 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-07 20:39:43,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 20:39:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-07 20:39:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-07 20:39:43,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:39:43,915 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:39:43,935 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-07 20:39:44,131 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-07 20:39:44,132 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:39:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:39:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 125449199, now seen corresponding path program 1 times [2022-04-07 20:39:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:39:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403404113] [2022-04-07 20:39:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:39:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:39:44,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:39:44,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977943399] [2022-04-07 20:39:44,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:39:44,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:39:44,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:39:44,155 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-07 20:39:44,190 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-07 20:39:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:39:44,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 20:39:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:39:44,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:39:44,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {1355#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {1355#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1355#true} is VALID [2022-04-07 20:39:44,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {1355#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1355#true} {1355#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {1355#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1355#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {1355#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#true} [94] assume_abort_if_notENTRY-->L9: 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] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {1355#true} [97] L9-->L9-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[] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {1355#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1355#true} {1355#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {1355#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1355#true} is VALID [2022-04-07 20:39:44,487 INFO L272 TraceCheckUtils]: 12: Hoare triple {1355#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1355#true} [94] assume_abort_if_notENTRY-->L9: 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] {1399#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:39:44,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {1399#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [97] L9-->L9-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[] {1403#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:44,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1403#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:39:44,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1403#(not (= |assume_abort_if_not_#in~cond| 0))} {1355#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1410#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-07 20:39:44,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {1410#(and (<= 0 main_~y~0) (<= main_~y~0 100))} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {1355#true} [94] assume_abort_if_notENTRY-->L9: 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] {1355#true} is VALID [2022-04-07 20:39:44,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {1355#true} [97] L9-->L9-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[] {1355#true} is VALID [2022-04-07 20:39:44,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {1355#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,490 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1355#true} {1410#(and (<= 0 main_~y~0) (<= main_~y~0 100))} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1410#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-07 20:39:44,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {1410#(and (<= 0 main_~y~0) (<= main_~y~0 100))} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1429#(<= 0 main_~b~0)} is VALID [2022-04-07 20:39:44,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {1429#(<= 0 main_~b~0)} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1429#(<= 0 main_~b~0)} is VALID [2022-04-07 20:39:44,491 INFO L272 TraceCheckUtils]: 24: Hoare triple {1429#(<= 0 main_~b~0)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {1355#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 20:39:44,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {1355#true} [112] L12-->L12-2: Formula: (not (= 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[] {1355#true} is VALID [2022-04-07 20:39:44,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {1355#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,492 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1355#true} {1429#(<= 0 main_~b~0)} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1429#(<= 0 main_~b~0)} is VALID [2022-04-07 20:39:44,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {1429#(<= 0 main_~b~0)} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [119] L44-->L47-2: Formula: (and (= v_main_~a~0_4 (+ (- 1) v_main_~a~0_5)) (= (let ((.cse0 (mod v_main_~b~0_4 2))) (ite (and (< v_main_~b~0_4 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 0) (= v_main_~q~0_1 (+ (* v_main_~b~0_4 v_main_~p~0_3) v_main_~q~0_2)) (= (let ((.cse1 (mod v_main_~a~0_5 2))) (ite (and (not (= .cse1 0)) (< v_main_~a~0_5 0)) (+ .cse1 (- 2)) .cse1)) 1)) InVars {main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_5} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~a~0] {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,494 INFO L272 TraceCheckUtils]: 33: Hoare triple {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {1355#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 20:39:44,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {1355#true} [112] L12-->L12-2: Formula: (not (= 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[] {1355#true} is VALID [2022-04-07 20:39:44,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {1355#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,496 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1355#true} {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {1451#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {1479#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,497 INFO L272 TraceCheckUtils]: 39: Hoare triple {1479#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {1355#true} is VALID [2022-04-07 20:39:44,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {1355#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 20:39:44,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {1355#true} [112] L12-->L12-2: Formula: (not (= 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[] {1355#true} is VALID [2022-04-07 20:39:44,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {1355#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,499 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1355#true} {1479#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {1479#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 20:39:44,500 INFO L272 TraceCheckUtils]: 44: Hoare triple {1479#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:39:44,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {1498#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:39:44,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {1502#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1356#false} is VALID [2022-04-07 20:39:44,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {1356#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#false} is VALID [2022-04-07 20:39:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 20:39:44,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:39:44,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {1356#false} [116] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#false} is VALID [2022-04-07 20:39:44,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {1502#(<= 1 __VERIFIER_assert_~cond)} [111] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1356#false} is VALID [2022-04-07 20:39:44,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {1498#(<= 1 |__VERIFIER_assert_#in~cond|)} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:39:44,801 INFO L272 TraceCheckUtils]: 44: Hoare triple {1518#(= (* main_~b~0 main_~a~0) 0)} [106] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~a~0_17 v_main_~b~0_17) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~b~0=v_main_~b~0_17, main_~a~0=v_main_~a~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:39:44,802 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1355#true} {1518#(= (* main_~b~0 main_~a~0) 0)} [129] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {1518#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-07 20:39:44,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {1355#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {1355#true} [112] L12-->L12-2: Formula: (not (= 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[] {1355#true} is VALID [2022-04-07 20:39:44,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {1355#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 20:39:44,802 INFO L272 TraceCheckUtils]: 39: Hoare triple {1518#(= (* main_~b~0 main_~a~0) 0)} [104] L34-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~q~0_12 (* v_main_~x~0_10 v_main_~y~0_11)) 1 0)) InVars {main_~q~0=v_main_~q~0_12, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10} 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] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {1355#true} [108] L35-1-->L34-2: Formula: (or (= 0 v_main_~b~0_14) (= 0 v_main_~a~0_14)) InVars {main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} OutVars{main_~b~0=v_main_~b~0_14, main_~a~0=v_main_~a~0_14} AuxVars[] AssignedVars[] {1518#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-07 20:39:44,804 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1355#true} {1355#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {1355#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {1355#true} [112] L12-->L12-2: Formula: (not (= 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[] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {1355#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L272 TraceCheckUtils]: 33: Hoare triple {1355#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {1355#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {1355#true} [119] L44-->L47-2: Formula: (and (= v_main_~a~0_4 (+ (- 1) v_main_~a~0_5)) (= (let ((.cse0 (mod v_main_~b~0_4 2))) (ite (and (< v_main_~b~0_4 0) (not (= .cse0 0))) (+ .cse0 (- 2)) .cse0)) 0) (= v_main_~q~0_1 (+ (* v_main_~b~0_4 v_main_~p~0_3) v_main_~q~0_2)) (= (let ((.cse1 (mod v_main_~a~0_5 2))) (ite (and (not (= .cse1 0)) (< v_main_~a~0_5 0)) (+ .cse1 (- 2)) .cse1)) 1)) InVars {main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_5} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {1355#true} [114] L40-->L44: Formula: (or (not (= (let ((.cse0 (mod v_main_~a~0_3 2))) (ite (and (< v_main_~a~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0)) (not (= 0 (let ((.cse1 (mod v_main_~b~0_3 2))) (ite (and (not (= .cse1 0)) (< v_main_~b~0_3 0)) (+ .cse1 (- 2)) .cse1))))) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {1355#true} [109] L35-1-->L40: Formula: (and (not (= 0 v_main_~b~0_15)) (not (= 0 v_main_~a~0_15))) InVars {main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} OutVars{main_~b~0=v_main_~b~0_15, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1355#true} {1355#true} [128] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {1355#true} [118] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {1355#true} [112] L12-->L12-2: Formula: (not (= 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[] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {1355#true} [107] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L272 TraceCheckUtils]: 24: Hoare triple {1355#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (* v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~q~0_11 (* v_main_~p~0_9 (* v_main_~a~0_16 v_main_~b~0_16)))) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_16, main_~p~0=v_main_~p~0_9, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {1355#true} [103] L47-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {1355#true} [100] L27-->L47-2: Formula: (and (= v_main_~q~0_8 0) (= v_main_~y~0_5 v_main_~b~0_11) (= v_main_~x~0_5 v_main_~a~0_11) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_7, main_~a~0=v_main_~a~0_11} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1355#true} {1355#true} [126] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {1355#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1355#true} [97] L9-->L9-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[] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {1355#true} [94] assume_abort_if_notENTRY-->L9: 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] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L272 TraceCheckUtils]: 17: Hoare triple {1355#true} [98] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1355#true} {1355#true} [125] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1355#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1355#true} [97] L9-->L9-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[] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {1355#true} [94] assume_abort_if_notENTRY-->L9: 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] {1355#true} is VALID [2022-04-07 20:39:44,806 INFO L272 TraceCheckUtils]: 12: Hoare triple {1355#true} [95] L26-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~y~0_8 100) (<= 0 v_main_~y~0_8)) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {1355#true} [93] L24-1-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1355#true} {1355#true} [124] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {1355#true} [99] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {1355#true} [97] L9-->L9-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[] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#true} [94] assume_abort_if_notENTRY-->L9: 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] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {1355#true} [92] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~x~0_8) (<= v_main_~x~0_8 100)) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1355#true} [90] mainENTRY-->L24: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~a~0] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {1355#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1355#true} {1355#true} [123] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1355#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1355#true} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1355#true} is VALID [2022-04-07 20:39:44,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {1355#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 20:39:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 20:39:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:39:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403404113] [2022-04-07 20:39:44,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:39:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977943399] [2022-04-07 20:39:44,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977943399] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 20:39:44,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 20:39:44,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-07 20:39:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562336721] [2022-04-07 20:39:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:39:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-07 20:39:44,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:39:44,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 20:39:44,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:39:44,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 20:39:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:39:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 20:39:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-07 20:39:44,838 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 20:39:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:45,128 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-07 20:39:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 20:39:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-07 20:39:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:39:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 20:39:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 20:39:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 20:39:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 20:39:45,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-07 20:39:45,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:39:45,161 INFO L225 Difference]: With dead ends: 36 [2022-04-07 20:39:45,161 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 20:39:45,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-07 20:39:45,162 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 20:39:45,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 20:39:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 20:39:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 20:39:45,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:39:45,163 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-07 20:39:45,163 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-07 20:39:45,163 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-07 20:39:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:45,164 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 20:39:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:39:45,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:45,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:39:45,164 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-07 20:39:45,164 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-07 20:39:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:39:45,164 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 20:39:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:39:45,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:45,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:39:45,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:39:45,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:39:45,165 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-07 20:39:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 20:39:45,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-07 20:39:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:39:45,165 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 20:39:45,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 20:39:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 20:39:45,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:39:45,167 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 20:39:45,183 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-07 20:39:45,368 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-07 20:39:45,370 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 20:39:45,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 20:39:45,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:39:45 BasicIcfg [2022-04-07 20:39:45,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 20:39:45,376 INFO L158 Benchmark]: Toolchain (without parser) took 50387.45ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 131.7MB in the beginning and 155.2MB in the end (delta: -23.5MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-07 20:39:45,376 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:39:45,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.80ms. Allocated memory is still 182.5MB. Free memory was 131.6MB in the beginning and 157.4MB in the end (delta: -25.8MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-07 20:39:45,376 INFO L158 Benchmark]: Boogie Preprocessor took 25.02ms. Allocated memory is still 182.5MB. Free memory was 157.4MB in the beginning and 156.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 20:39:45,377 INFO L158 Benchmark]: RCFGBuilder took 298.55ms. Allocated memory is still 182.5MB. Free memory was 156.1MB in the beginning and 143.1MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 20:39:45,377 INFO L158 Benchmark]: IcfgTransformer took 39.22ms. Allocated memory is still 182.5MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 20:39:45,377 INFO L158 Benchmark]: TraceAbstraction took 49771.40ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 140.6MB in the beginning and 155.2MB in the end (delta: -14.5MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2022-04-07 20:39:45,379 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.80ms. Allocated memory is still 182.5MB. Free memory was 131.6MB in the beginning and 157.4MB in the end (delta: -25.8MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.02ms. Allocated memory is still 182.5MB. Free memory was 157.4MB in the beginning and 156.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.55ms. Allocated memory is still 182.5MB. Free memory was 156.1MB in the beginning and 143.1MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 39.22ms. Allocated memory is still 182.5MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 49771.40ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 140.6MB in the beginning and 155.2MB in the end (delta: -14.5MB). Peak memory consumption was 23.2MB. 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: 14]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.7s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 560 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 140 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 957 SizeOfPredicates, 18 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 173/196 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-07 20:39:45,397 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...