/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/loop-acceleration/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:56:25,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:56:25,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:56:25,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:56:25,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:56:25,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:56:25,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:56:25,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:56:25,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:56:25,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:56:25,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:56:25,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:56:25,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:56:25,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:56:25,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:56:25,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:56:25,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:56:25,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:56:25,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:56:25,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:56:25,900 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:56:25,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:56:25,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:56:25,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:56:25,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:56:25,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:56:25,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:56:25,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:56:25,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:56:25,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:56:25,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:56:25,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:56:25,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:56:25,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:56:25,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:56:25,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:56:25,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:56:25,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:56:25,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:56:25,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:56:25,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:56:25,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:56:25,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:56:25,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:56:25,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:56:25,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:56:25,932 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:56:25,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:56:25,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:56:25,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:56:25,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:56:25,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:56:25,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:56:25,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:56:25,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:56:25,934 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:56:25,934 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 16:56:26,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:56:26,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:56:26,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:56:26,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:56:26,114 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:56:26,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-07 16:56:26,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a74859e4/00ae293b8e874b3ca7b8db890d3927ae/FLAG9a2cee04c [2022-04-07 16:56:26,499 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:56:26,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-07 16:56:26,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a74859e4/00ae293b8e874b3ca7b8db890d3927ae/FLAG9a2cee04c [2022-04-07 16:56:26,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a74859e4/00ae293b8e874b3ca7b8db890d3927ae [2022-04-07 16:56:26,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:56:26,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:56:26,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:56:26,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:56:26,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:56:26,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac6c827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26, skipping insertion in model container [2022-04-07 16:56:26,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:56:26,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:56:26,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c[373,386] [2022-04-07 16:56:26,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:56:26,685 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:56:26,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c[373,386] [2022-04-07 16:56:26,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:56:26,704 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:56:26,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26 WrapperNode [2022-04-07 16:56:26,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:56:26,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:56:26,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:56:26,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:56:26,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:56:26,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:56:26,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:56:26,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:56:26,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:56:26,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:26,753 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 16:56:26,761 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 16:56:26,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:56:26,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:56:26,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:56:26,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:56:26,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:56:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:56:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:56:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:56:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:56:26,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:56:26,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:56:26,842 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:56:26,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:56:26,932 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:56:26,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:56:26,937 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:56:26,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:56:26 BoogieIcfgContainer [2022-04-07 16:56:26,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:56:26,939 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:56:26,939 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:56:26,940 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:56:26,942 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:56:26" (1/1) ... [2022-04-07 16:56:26,943 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:56:26,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:56:26 BasicIcfg [2022-04-07 16:56:26,955 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:56:26,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:56:26,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:56:26,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:56:26,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:56:26" (1/4) ... [2022-04-07 16:56:26,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c21170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:56:26, skipping insertion in model container [2022-04-07 16:56:26,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:56:26" (2/4) ... [2022-04-07 16:56:26,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c21170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:56:26, skipping insertion in model container [2022-04-07 16:56:26,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:56:26" (3/4) ... [2022-04-07 16:56:26,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c21170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:56:26, skipping insertion in model container [2022-04-07 16:56:26,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:56:26" (4/4) ... [2022-04-07 16:56:26,961 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-2.cJordan [2022-04-07 16:56:26,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:56:26,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:56:26,992 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:56:26,996 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 16:56:26,997 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:56:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:56:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:56:27,013 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:27,013 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:27,014 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-07 16:56:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:27,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757300325] [2022-04-07 16:56:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {22#true} is VALID [2022-04-07 16:56:27,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:56:27,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:56:27,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:27,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {22#true} is VALID [2022-04-07 16:56:27,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:56:27,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:56:27,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 16:56:27,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {22#true} is VALID [2022-04-07 16:56:27,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [51] L18-2-->L17-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 16:56:27,156 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {23#false} is VALID [2022-04-07 16:56:27,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [58] __VERIFIER_assertENTRY-->L7: 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] {23#false} is VALID [2022-04-07 16:56:27,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [59] L7-->L8: 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[] {23#false} is VALID [2022-04-07 16:56:27,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 16:56:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:27,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757300325] [2022-04-07 16:56:27,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757300325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:56:27,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:56:27,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:56:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006994689] [2022-04-07 16:56:27,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:56:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 16:56:27,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:27,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:27,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:56:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:56:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:56:27,202 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:27,274 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-07 16:56:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:56:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 16:56:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-07 16:56:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-07 16:56:27,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-04-07 16:56:27,315 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 16:56:27,320 INFO L225 Difference]: With dead ends: 19 [2022-04-07 16:56:27,320 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 16:56:27,321 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 16:56:27,324 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:27,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:56:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 16:56:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 16:56:27,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:27,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,350 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,351 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:27,364 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-07 16:56:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 16:56:27,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:27,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:27,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 16:56:27,365 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 16:56:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:27,370 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-07 16:56:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 16:56:27,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:27,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:27,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:27,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-07 16:56:27,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-07 16:56:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:27,374 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-07 16:56:27,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 16:56:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:56:27,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:27,375 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:27,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:56:27,375 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-07 16:56:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:27,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972941070] [2022-04-07 16:56:27,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {88#true} is VALID [2022-04-07 16:56:27,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:56:27,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88#true} {88#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:56:27,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {88#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:27,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {88#true} is VALID [2022-04-07 16:56:27,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:56:27,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88#true} {88#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:56:27,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-07 16:56:27,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {93#(= main_~x~0 0)} is VALID [2022-04-07 16:56:27,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {93#(= main_~x~0 0)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-07 16:56:27,517 INFO L272 TraceCheckUtils]: 7: Hoare triple {89#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {89#false} is VALID [2022-04-07 16:56:27,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {89#false} [58] __VERIFIER_assertENTRY-->L7: 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] {89#false} is VALID [2022-04-07 16:56:27,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {89#false} [59] L7-->L8: 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[] {89#false} is VALID [2022-04-07 16:56:27,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-07 16:56:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972941070] [2022-04-07 16:56:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972941070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:56:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:56:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:56:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942679672] [2022-04-07 16:56:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:56:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 16:56:27,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:27,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:27,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:56:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:56:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:56:27,537 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:27,609 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-07 16:56:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:56:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 16:56:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-07 16:56:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-07 16:56:27,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-07 16:56:27,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:27,633 INFO L225 Difference]: With dead ends: 15 [2022-04-07 16:56:27,633 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 16:56:27,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:56:27,635 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:27,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:56:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 16:56:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-07 16:56:27,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:27,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,638 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,638 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:27,644 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-07 16:56:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-07 16:56:27,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:27,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:27,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 16:56:27,645 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 16:56:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:27,646 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-07 16:56:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-07 16:56:27,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:27,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:27,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:27,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 16:56:27,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-07 16:56:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:27,648 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 16:56:27,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:56:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 16:56:27,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:27,649 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:27,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:56:27,649 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-07 16:56:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982058895] [2022-04-07 16:56:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-07 16:56:27,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:27,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-07 16:56:27,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {163#(= main_~x~0 0)} is VALID [2022-04-07 16:56:27,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {163#(= main_~x~0 0)} is VALID [2022-04-07 16:56:27,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {164#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:56:27,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:56:27,765 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {159#false} is VALID [2022-04-07 16:56:27,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#false} [58] __VERIFIER_assertENTRY-->L7: 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] {159#false} is VALID [2022-04-07 16:56:27,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [59] L7-->L8: 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[] {159#false} is VALID [2022-04-07 16:56:27,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:56:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982058895] [2022-04-07 16:56:27,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982058895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726360685] [2022-04-07 16:56:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:27,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:27,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:27,768 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 16:56:27,769 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 16:56:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 16:56:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:27,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:27,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-07 16:56:27,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {163#(= main_~x~0 0)} is VALID [2022-04-07 16:56:27,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {163#(= main_~x~0 0)} is VALID [2022-04-07 16:56:27,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {190#(= main_~x~0 1)} is VALID [2022-04-07 16:56:27,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(= main_~x~0 1)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:56:27,906 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {159#false} is VALID [2022-04-07 16:56:27,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#false} [58] __VERIFIER_assertENTRY-->L7: 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] {159#false} is VALID [2022-04-07 16:56:27,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [59] L7-->L8: 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[] {159#false} is VALID [2022-04-07 16:56:27,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:56:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:27,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:27,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {159#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:56:27,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [59] L7-->L8: 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[] {159#false} is VALID [2022-04-07 16:56:27,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#false} [58] __VERIFIER_assertENTRY-->L7: 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] {159#false} is VALID [2022-04-07 16:56:27,993 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {159#false} is VALID [2022-04-07 16:56:27,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-07 16:56:27,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {222#(< (mod (+ main_~x~0 1) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {218#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 16:56:27,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(< (mod (+ main_~x~0 1) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {222#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:56:27,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {222#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:56:27,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-07 16:56:27,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-07 16:56:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:27,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726360685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:27,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:27,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 16:56:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202251] [2022-04-07 16:56:27,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 16:56:27,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:27,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:28,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:56:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:56:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:56:28,017 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:28,166 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-07 16:56:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 16:56:28,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 16:56:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-07 16:56:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-07 16:56:28,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-07 16:56:28,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:28,197 INFO L225 Difference]: With dead ends: 20 [2022-04-07 16:56:28,197 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 16:56:28,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:56:28,199 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:28,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:56:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 16:56:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-07 16:56:28,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:28,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,201 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,202 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:28,203 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-07 16:56:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-07 16:56:28,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:28,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:28,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-07 16:56:28,204 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-07 16:56:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:28,205 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-07 16:56:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-07 16:56:28,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:28,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:28,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:28,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-07 16:56:28,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-04-07 16:56:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:28,206 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-07 16:56:28,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-07 16:56:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 16:56:28,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:28,207 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:28,239 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 16:56:28,440 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:28,440 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash -341862240, now seen corresponding path program 1 times [2022-04-07 16:56:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:28,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806506935] [2022-04-07 16:56:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:28,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:28,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {334#true} is VALID [2022-04-07 16:56:28,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:28,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {334#true} is VALID [2022-04-07 16:56:28,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {339#(= main_~x~0 0)} is VALID [2022-04-07 16:56:28,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {339#(= main_~x~0 0)} is VALID [2022-04-07 16:56:28,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:28,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:28,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {341#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:56:28,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:56:28,534 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {335#false} is VALID [2022-04-07 16:56:28,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} [58] __VERIFIER_assertENTRY-->L7: 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] {335#false} is VALID [2022-04-07 16:56:28,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} [59] L7-->L8: 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[] {335#false} is VALID [2022-04-07 16:56:28,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {335#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:56:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806506935] [2022-04-07 16:56:28,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806506935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189488693] [2022-04-07 16:56:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:28,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:28,550 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 16:56:28,552 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 16:56:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:28,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 16:56:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:28,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:28,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {334#true} is VALID [2022-04-07 16:56:28,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {339#(= main_~x~0 0)} is VALID [2022-04-07 16:56:28,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {339#(= main_~x~0 0)} is VALID [2022-04-07 16:56:28,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:28,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:28,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {373#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:28,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {373#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:56:28,849 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {335#false} is VALID [2022-04-07 16:56:28,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} [58] __VERIFIER_assertENTRY-->L7: 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] {335#false} is VALID [2022-04-07 16:56:28,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} [59] L7-->L8: 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[] {335#false} is VALID [2022-04-07 16:56:28,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {335#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:56:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:28,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:28,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {335#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:56:28,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} [59] L7-->L8: 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[] {335#false} is VALID [2022-04-07 16:56:28,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} [58] __VERIFIER_assertENTRY-->L7: 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] {335#false} is VALID [2022-04-07 16:56:28,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {335#false} is VALID [2022-04-07 16:56:28,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {401#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {335#false} is VALID [2022-04-07 16:56:28,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(< (mod (+ main_~x~0 2) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {401#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 16:56:28,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {405#(< (mod (+ main_~x~0 2) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {405#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:28,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(< (mod (+ main_~x~0 4) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {405#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:28,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(< (mod (+ main_~x~0 4) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {412#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:28,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {412#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:28,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {334#true} is VALID [2022-04-07 16:56:28,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#true} is VALID [2022-04-07 16:56:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:28,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189488693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:28,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:28,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-07 16:56:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670029883] [2022-04-07 16:56:28,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:28,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 16:56:28,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:28,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:28,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:28,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 16:56:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:28,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 16:56:28,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-07 16:56:28,952 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:29,233 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-07 16:56:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 16:56:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 16:56:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-07 16:56:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-07 16:56:29,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-07 16:56:29,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:29,285 INFO L225 Difference]: With dead ends: 31 [2022-04-07 16:56:29,285 INFO L226 Difference]: Without dead ends: 31 [2022-04-07 16:56:29,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-04-07 16:56:29,286 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:29,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:56:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-07 16:56:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-07 16:56:29,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:29,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,291 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,291 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:29,292 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-07 16:56:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-07 16:56:29,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:29,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:29,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-07 16:56:29,293 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-07 16:56:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:29,294 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-07 16:56:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-07 16:56:29,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:29,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:29,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:29,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-07 16:56:29,296 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2022-04-07 16:56:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:29,296 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-07 16:56:29,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-07 16:56:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 16:56:29,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:29,296 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:29,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 16:56:29,510 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,SelfDestructingSolverStorable3 [2022-04-07 16:56:29,510 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 265640572, now seen corresponding path program 2 times [2022-04-07 16:56:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:29,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573594195] [2022-04-07 16:56:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:29,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {567#true} is VALID [2022-04-07 16:56:29,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {567#true} {567#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:29,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {567#true} is VALID [2022-04-07 16:56:29,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {572#(= main_~x~0 0)} is VALID [2022-04-07 16:56:29,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {572#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {572#(= main_~x~0 0)} is VALID [2022-04-07 16:56:29,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {572#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:29,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:29,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:29,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:29,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:29,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:29,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:29,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:29,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {577#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:29,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {577#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-07 16:56:29,670 INFO L272 TraceCheckUtils]: 17: Hoare triple {568#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {568#false} is VALID [2022-04-07 16:56:29,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {568#false} [58] __VERIFIER_assertENTRY-->L7: 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] {568#false} is VALID [2022-04-07 16:56:29,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {568#false} [59] L7-->L8: 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[] {568#false} is VALID [2022-04-07 16:56:29,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {568#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-07 16:56:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573594195] [2022-04-07 16:56:29,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573594195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655462350] [2022-04-07 16:56:29,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:56:29,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:29,672 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 16:56:29,673 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 16:56:29,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:56:29,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:56:29,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 16:56:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:29,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:29,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {567#true} is VALID [2022-04-07 16:56:29,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:29,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {572#(= main_~x~0 0)} is VALID [2022-04-07 16:56:29,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {572#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {572#(= main_~x~0 0)} is VALID [2022-04-07 16:56:29,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {572#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:29,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:29,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:29,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:29,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:29,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:29,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:29,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:29,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {576#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {627#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:29,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {627#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-07 16:56:29,939 INFO L272 TraceCheckUtils]: 17: Hoare triple {568#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {568#false} is VALID [2022-04-07 16:56:29,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {568#false} [58] __VERIFIER_assertENTRY-->L7: 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] {568#false} is VALID [2022-04-07 16:56:29,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {568#false} [59] L7-->L8: 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[] {568#false} is VALID [2022-04-07 16:56:29,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {568#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-07 16:56:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:29,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:30,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {568#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-07 16:56:30,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {568#false} [59] L7-->L8: 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[] {568#false} is VALID [2022-04-07 16:56:30,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {568#false} [58] __VERIFIER_assertENTRY-->L7: 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] {568#false} is VALID [2022-04-07 16:56:30,086 INFO L272 TraceCheckUtils]: 17: Hoare triple {568#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {568#false} is VALID [2022-04-07 16:56:30,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {655#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {568#false} is VALID [2022-04-07 16:56:30,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {659#(< (mod (+ main_~x~0 1) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {655#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 16:56:30,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#(< (mod (+ main_~x~0 1) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {659#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:56:30,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {666#(< (mod (+ main_~x~0 2) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {659#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:56:30,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(< (mod (+ main_~x~0 2) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {666#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:30,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(< (mod (+ main_~x~0 3) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {666#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:30,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(< (mod (+ main_~x~0 3) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {673#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-07 16:56:30,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(< (mod (+ main_~x~0 4) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {673#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-07 16:56:30,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {680#(< (mod (+ main_~x~0 4) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {680#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:30,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {687#(< (mod (+ 5 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {680#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:30,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#(< (mod (+ 5 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {687#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:56:30,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {687#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:56:30,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:30,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:30,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:30,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {567#true} is VALID [2022-04-07 16:56:30,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-04-07 16:56:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655462350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:30,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:30,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-07 16:56:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222161297] [2022-04-07 16:56:30,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 16:56:30,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:30,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:30,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 16:56:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 16:56:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-07 16:56:30,131 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:30,912 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 16:56:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 16:56:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 16:56:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2022-04-07 16:56:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2022-04-07 16:56:30,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 55 transitions. [2022-04-07 16:56:30,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:30,990 INFO L225 Difference]: With dead ends: 66 [2022-04-07 16:56:30,990 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 16:56:30,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2022-04-07 16:56:30,991 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:30,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 48 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 16:56:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 16:56:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 36. [2022-04-07 16:56:30,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:30,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,994 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,994 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:30,997 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 16:56:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-07 16:56:30,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:30,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:30,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-07 16:56:30,997 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-07 16:56:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:30,999 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 16:56:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-07 16:56:31,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:31,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:31,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:31,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 16:56:31,001 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 21 [2022-04-07 16:56:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:31,001 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 16:56:31,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 16:56:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 16:56:31,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:31,002 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:31,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 16:56:31,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:31,219 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash -819090412, now seen corresponding path program 2 times [2022-04-07 16:56:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:31,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451936259] [2022-04-07 16:56:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:31,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {969#true} is VALID [2022-04-07 16:56:31,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {969#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {969#true} {969#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {969#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:31,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {969#true} is VALID [2022-04-07 16:56:31,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {969#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {969#true} {969#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {969#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {969#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {974#(= main_~x~0 0)} is VALID [2022-04-07 16:56:31,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {974#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {974#(= main_~x~0 0)} is VALID [2022-04-07 16:56:31,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {974#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:31,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:31,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:31,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:31,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:31,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:31,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:31,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:31,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:31,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:31,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {980#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:56:31,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {970#false} is VALID [2022-04-07 16:56:31,351 INFO L272 TraceCheckUtils]: 19: Hoare triple {970#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {970#false} is VALID [2022-04-07 16:56:31,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {970#false} [58] __VERIFIER_assertENTRY-->L7: 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] {970#false} is VALID [2022-04-07 16:56:31,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {970#false} [59] L7-->L8: 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[] {970#false} is VALID [2022-04-07 16:56:31,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {970#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {970#false} is VALID [2022-04-07 16:56:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:31,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:31,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451936259] [2022-04-07 16:56:31,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451936259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:31,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284580755] [2022-04-07 16:56:31,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:56:31,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:31,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:31,353 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 16:56:31,373 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 16:56:31,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:56:31,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:56:31,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 16:56:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:31,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:31,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {969#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {969#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {969#true} is VALID [2022-04-07 16:56:31,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {969#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {969#true} {969#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {969#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {969#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {974#(= main_~x~0 0)} is VALID [2022-04-07 16:56:31,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {974#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {974#(= main_~x~0 0)} is VALID [2022-04-07 16:56:31,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {974#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:31,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:31,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:31,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:31,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {976#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:31,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:31,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {977#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:31,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:31,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:31,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:31,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1036#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:31,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {1036#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {970#false} is VALID [2022-04-07 16:56:31,623 INFO L272 TraceCheckUtils]: 19: Hoare triple {970#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {970#false} is VALID [2022-04-07 16:56:31,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {970#false} [58] __VERIFIER_assertENTRY-->L7: 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] {970#false} is VALID [2022-04-07 16:56:31,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {970#false} [59] L7-->L8: 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[] {970#false} is VALID [2022-04-07 16:56:31,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {970#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {970#false} is VALID [2022-04-07 16:56:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:31,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:31,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {970#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {970#false} is VALID [2022-04-07 16:56:31,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {970#false} [59] L7-->L8: 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[] {970#false} is VALID [2022-04-07 16:56:31,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {970#false} [58] __VERIFIER_assertENTRY-->L7: 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] {970#false} is VALID [2022-04-07 16:56:31,797 INFO L272 TraceCheckUtils]: 19: Hoare triple {970#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {970#false} is VALID [2022-04-07 16:56:31,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {1064#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {970#false} is VALID [2022-04-07 16:56:31,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {1068#(< (mod (+ main_~x~0 2) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1064#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 16:56:31,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#(< (mod (+ main_~x~0 2) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1068#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:31,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#(< (mod (+ main_~x~0 4) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1068#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:31,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#(< (mod (+ main_~x~0 4) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1075#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:31,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1082#(< (mod (+ main_~x~0 6) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1075#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:31,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(< (mod (+ main_~x~0 6) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1082#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 16:56:31,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#(< (mod (+ main_~x~0 8) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1082#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 16:56:31,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#(< (mod (+ main_~x~0 8) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1089#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 16:56:31,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#(< (mod (+ main_~x~0 10) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1089#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 16:56:31,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(< (mod (+ main_~x~0 10) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1096#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 16:56:31,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1103#(< (mod (+ main_~x~0 12) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1096#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 16:56:31,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#(< (mod (+ main_~x~0 12) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1103#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 16:56:31,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {969#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {1103#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 16:56:31,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {969#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {969#true} {969#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {969#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {969#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {969#true} is VALID [2022-04-07 16:56:31,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {969#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#true} is VALID [2022-04-07 16:56:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:31,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284580755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:31,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:31,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-07 16:56:31,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020570968] [2022-04-07 16:56:31,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 16:56:31,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:31,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:31,843 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 16:56:31,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 16:56:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 16:56:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-07 16:56:31,844 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,050 INFO L93 Difference]: Finished difference Result 144 states and 205 transitions. [2022-04-07 16:56:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-07 16:56:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 16:56:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-07 16:56:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-07 16:56:33,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-07 16:56:33,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:33,185 INFO L225 Difference]: With dead ends: 144 [2022-04-07 16:56:33,185 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 16:56:33,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=732, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 16:56:33,186 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:33,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 16:56:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 16:56:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 80. [2022-04-07 16:56:33,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:33,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,191 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,191 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,195 INFO L93 Difference]: Finished difference Result 144 states and 205 transitions. [2022-04-07 16:56:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2022-04-07 16:56:33,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:33,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:33,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-07 16:56:33,196 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-07 16:56:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,212 INFO L93 Difference]: Finished difference Result 144 states and 205 transitions. [2022-04-07 16:56:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2022-04-07 16:56:33,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:33,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:33,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:33,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2022-04-07 16:56:33,215 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 23 [2022-04-07 16:56:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:33,215 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2022-04-07 16:56:33,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2022-04-07 16:56:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 16:56:33,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:33,216 INFO L499 BasicCegarLoop]: trace histogram [9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:33,243 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 16:56:33,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:33,427 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -382718831, now seen corresponding path program 1 times [2022-04-07 16:56:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194915941] [2022-04-07 16:56:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {1675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1669#true} is VALID [2022-04-07 16:56:33,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1669#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1669#true} is VALID [2022-04-07 16:56:33,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1669#true} {1669#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1669#true} is VALID [2022-04-07 16:56:33,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1669#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:33,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1669#true} is VALID [2022-04-07 16:56:33,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {1669#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1669#true} is VALID [2022-04-07 16:56:33,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1669#true} {1669#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1669#true} is VALID [2022-04-07 16:56:33,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {1669#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1669#true} is VALID [2022-04-07 16:56:33,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {1669#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {1669#true} is VALID [2022-04-07 16:56:33,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#true} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1669#true} is VALID [2022-04-07 16:56:33,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#true} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {1674#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {1670#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {1670#false} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {1670#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {1670#false} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {1670#false} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L272 TraceCheckUtils]: 25: Hoare triple {1670#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {1670#false} [58] __VERIFIER_assertENTRY-->L7: 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] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {1670#false} [59] L7-->L8: 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[] {1670#false} is VALID [2022-04-07 16:56:33,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {1670#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1670#false} is VALID [2022-04-07 16:56:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-07 16:56:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:33,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194915941] [2022-04-07 16:56:33,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194915941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:56:33,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:56:33,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:56:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188209095] [2022-04-07 16:56:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:56:33,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-07 16:56:33,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:33,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:33,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:56:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:56:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:56:33,478 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,510 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-04-07 16:56:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:56:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-07 16:56:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 16:56:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 16:56:33,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-07 16:56:33,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:33,526 INFO L225 Difference]: With dead ends: 90 [2022-04-07 16:56:33,526 INFO L226 Difference]: Without dead ends: 90 [2022-04-07 16:56:33,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:56:33,527 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:33,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:56:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-07 16:56:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2022-04-07 16:56:33,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:33,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,530 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,531 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 63 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,532 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-04-07 16:56:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2022-04-07 16:56:33,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:33,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:33,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-07 16:56:33,533 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-07 16:56:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,535 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-04-07 16:56:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2022-04-07 16:56:33,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:33,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:33,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:33,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2022-04-07 16:56:33,536 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 29 [2022-04-07 16:56:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:33,536 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2022-04-07 16:56:33,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-04-07 16:56:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 16:56:33,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:33,537 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:33,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 16:56:33,537 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1436785103, now seen corresponding path program 2 times [2022-04-07 16:56:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:33,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984533513] [2022-04-07 16:56:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:33,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2014#true} is VALID [2022-04-07 16:56:33,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {2014#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2014#true} is VALID [2022-04-07 16:56:33,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2014#true} {2014#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2014#true} is VALID [2022-04-07 16:56:33,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {2014#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:33,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2014#true} is VALID [2022-04-07 16:56:33,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {2014#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2014#true} is VALID [2022-04-07 16:56:33,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2014#true} {2014#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2014#true} is VALID [2022-04-07 16:56:33,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {2014#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2014#true} is VALID [2022-04-07 16:56:33,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {2014#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2014#true} is VALID [2022-04-07 16:56:33,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {2014#true} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2014#true} is VALID [2022-04-07 16:56:33,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {2014#true} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2019#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-07 16:56:33,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {2019#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2019#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {2019#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {2015#false} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {2015#false} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {2015#false} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L272 TraceCheckUtils]: 29: Hoare triple {2015#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {2015#false} [58] __VERIFIER_assertENTRY-->L7: 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] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {2015#false} [59] L7-->L8: 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[] {2015#false} is VALID [2022-04-07 16:56:33,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {2015#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2015#false} is VALID [2022-04-07 16:56:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-07 16:56:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:33,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984533513] [2022-04-07 16:56:33,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984533513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:56:33,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:56:33,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:56:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607398784] [2022-04-07 16:56:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:56:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-07 16:56:33,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:33,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:33,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:56:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:56:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:56:33,583 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,618 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-04-07 16:56:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:56:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-07 16:56:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 16:56:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 16:56:33,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-07 16:56:33,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:33,634 INFO L225 Difference]: With dead ends: 64 [2022-04-07 16:56:33,634 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 16:56:33,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:56:33,635 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:33,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:56:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 16:56:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-07 16:56:33,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:33,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,638 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,638 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,639 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-04-07 16:56:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-04-07 16:56:33,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:33,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:33,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-07 16:56:33,640 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-07 16:56:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:33,641 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-04-07 16:56:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-04-07 16:56:33,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:33,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:33,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:33,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-07 16:56:33,642 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 33 [2022-04-07 16:56:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:33,642 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-07 16:56:33,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-07 16:56:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 16:56:33,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:33,643 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:33,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 16:56:33,643 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1063807026, now seen corresponding path program 3 times [2022-04-07 16:56:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:33,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765653048] [2022-04-07 16:56:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2281#true} is VALID [2022-04-07 16:56:33,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {2281#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:33,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2281#true} {2281#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:33,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {2281#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:33,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {2299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2281#true} is VALID [2022-04-07 16:56:33,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {2281#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:33,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:33,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {2281#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:33,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {2281#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2286#(= main_~x~0 0)} is VALID [2022-04-07 16:56:33,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {2286#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2286#(= main_~x~0 0)} is VALID [2022-04-07 16:56:33,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {2286#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:33,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:33,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:33,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:33,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:33,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:33,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:33,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:33,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:33,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:33,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:33,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:33,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:33,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:33,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:33,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:33,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:33,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:33,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:33,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:33,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:33,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:33,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2298#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:56:33,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {2298#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2282#false} is VALID [2022-04-07 16:56:33,883 INFO L272 TraceCheckUtils]: 31: Hoare triple {2282#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2282#false} is VALID [2022-04-07 16:56:33,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {2282#false} [58] __VERIFIER_assertENTRY-->L7: 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] {2282#false} is VALID [2022-04-07 16:56:33,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {2282#false} [59] L7-->L8: 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[] {2282#false} is VALID [2022-04-07 16:56:33,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {2282#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2282#false} is VALID [2022-04-07 16:56:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:33,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765653048] [2022-04-07 16:56:33,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765653048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:33,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116750456] [2022-04-07 16:56:33,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 16:56:33,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:33,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:56:33,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 16:56:33,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-04-07 16:56:33,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:56:33,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-07 16:56:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:33,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:34,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {2281#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:34,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {2281#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2281#true} is VALID [2022-04-07 16:56:34,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {2281#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:34,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:34,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {2281#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:34,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {2281#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2286#(= main_~x~0 0)} is VALID [2022-04-07 16:56:34,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {2286#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2286#(= main_~x~0 0)} is VALID [2022-04-07 16:56:34,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {2286#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:34,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:34,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {2287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:34,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:34,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {2288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:34,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:34,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {2289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:34,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:34,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:34,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:34,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {2291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:34,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:34,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {2292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:34,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:34,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {2293#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:34,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:34,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {2294#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:34,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:34,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:34,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:34,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {2296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:34,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:34,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {2297#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2390#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-07 16:56:34,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {2390#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2390#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-07 16:56:34,633 INFO L272 TraceCheckUtils]: 31: Hoare triple {2390#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2397#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:56:34,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {2397#(<= 1 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L7: 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] {2401#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:56:34,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {2401#(<= 1 __VERIFIER_assert_~cond)} [59] L7-->L8: 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[] {2282#false} is VALID [2022-04-07 16:56:34,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {2282#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2282#false} is VALID [2022-04-07 16:56:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:34,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:35,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {2282#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2282#false} is VALID [2022-04-07 16:56:35,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {2401#(<= 1 __VERIFIER_assert_~cond)} [59] L7-->L8: 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[] {2282#false} is VALID [2022-04-07 16:56:35,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {2397#(<= 1 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L7: 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] {2401#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:56:35,022 INFO L272 TraceCheckUtils]: 31: Hoare triple {2417#(= (mod main_~x~0 2) (mod main_~y~0 2))} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2397#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:56:35,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {2417#(= (mod main_~x~0 2) (mod main_~y~0 2))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2417#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-07 16:56:35,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2417#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-07 16:56:35,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {2424#(<= (mod (+ main_~x~0 1) 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(<= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 16:56:35,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= (mod main_~x~0 2) 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {2281#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-07 16:56:35,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {2281#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:35,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:35,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {2281#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:35,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {2281#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2281#true} is VALID [2022-04-07 16:56:35,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {2281#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2281#true} is VALID [2022-04-07 16:56:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 16:56:35,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116750456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:35,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:35,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 7] total 22 [2022-04-07 16:56:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41187077] [2022-04-07 16:56:35,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-07 16:56:35,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:35,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:35,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:35,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 16:56:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:35,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 16:56:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-07 16:56:35,068 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:36,227 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-04-07 16:56:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 16:56:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-07 16:56:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 63 transitions. [2022-04-07 16:56:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 63 transitions. [2022-04-07 16:56:36,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 63 transitions. [2022-04-07 16:56:36,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:36,281 INFO L225 Difference]: With dead ends: 72 [2022-04-07 16:56:36,281 INFO L226 Difference]: Without dead ends: 69 [2022-04-07 16:56:36,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2022-04-07 16:56:36,282 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:36,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 58 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 16:56:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-07 16:56:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-04-07 16:56:36,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:36,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,285 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,285 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:36,286 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-07 16:56:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-07 16:56:36,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:36,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:36,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-07 16:56:36,287 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-07 16:56:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:36,288 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-07 16:56:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-07 16:56:36,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:36,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:36,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:36,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-07 16:56:36,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 35 [2022-04-07 16:56:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:36,289 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-07 16:56:36,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-07 16:56:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 16:56:36,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:36,290 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:36,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 16:56:36,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:36,495 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 794106220, now seen corresponding path program 4 times [2022-04-07 16:56:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:36,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701880849] [2022-04-07 16:56:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:36,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {2857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2838#true} is VALID [2022-04-07 16:56:36,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2838#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:36,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2838#true} {2838#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:36,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {2838#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:36,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {2857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2838#true} is VALID [2022-04-07 16:56:36,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:36,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2838#true} {2838#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:36,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {2838#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:36,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {2838#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2843#(= main_~x~0 0)} is VALID [2022-04-07 16:56:36,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2843#(= main_~x~0 0)} is VALID [2022-04-07 16:56:36,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:36,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:36,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:36,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:36,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:36,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:36,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:36,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:36,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:36,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:36,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:36,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:36,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:36,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:36,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:36,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:36,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:36,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:36,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:36,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:36,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:36,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:36,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:36,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:36,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2856#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:56:36,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {2856#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2839#false} is VALID [2022-04-07 16:56:36,727 INFO L272 TraceCheckUtils]: 33: Hoare triple {2839#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2839#false} is VALID [2022-04-07 16:56:36,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {2839#false} [58] __VERIFIER_assertENTRY-->L7: 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] {2839#false} is VALID [2022-04-07 16:56:36,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {2839#false} [59] L7-->L8: 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[] {2839#false} is VALID [2022-04-07 16:56:36,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {2839#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2839#false} is VALID [2022-04-07 16:56:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701880849] [2022-04-07 16:56:36,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701880849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589527723] [2022-04-07 16:56:36,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 16:56:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:36,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:36,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:56:36,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 16:56:36,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 16:56:36,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:56:36,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 16:56:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:36,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:37,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {2838#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {2838#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2838#true} is VALID [2022-04-07 16:56:37,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2838#true} {2838#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {2838#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {2838#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2843#(= main_~x~0 0)} is VALID [2022-04-07 16:56:37,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2843#(= main_~x~0 0)} is VALID [2022-04-07 16:56:37,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:37,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:56:37,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {2844#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:37,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:37,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {2845#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:37,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:56:37,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2846#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:37,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:37,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {2847#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:37,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:56:37,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {2848#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:37,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:37,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2849#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:37,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:56:37,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:37,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:37,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {2851#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:37,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:56:37,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {2852#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:37,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:37,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {2853#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:37,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:56:37,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {2854#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:37,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:37,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {2855#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2954#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 16:56:37,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {2954#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2839#false} is VALID [2022-04-07 16:56:37,139 INFO L272 TraceCheckUtils]: 33: Hoare triple {2839#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2839#false} is VALID [2022-04-07 16:56:37,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {2839#false} [58] __VERIFIER_assertENTRY-->L7: 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] {2839#false} is VALID [2022-04-07 16:56:37,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {2839#false} [59] L7-->L8: 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[] {2839#false} is VALID [2022-04-07 16:56:37,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {2839#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2839#false} is VALID [2022-04-07 16:56:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:37,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:37,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {2839#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2839#false} is VALID [2022-04-07 16:56:37,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {2839#false} [59] L7-->L8: 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[] {2839#false} is VALID [2022-04-07 16:56:37,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {2839#false} [58] __VERIFIER_assertENTRY-->L7: 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] {2839#false} is VALID [2022-04-07 16:56:37,579 INFO L272 TraceCheckUtils]: 33: Hoare triple {2839#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2839#false} is VALID [2022-04-07 16:56:37,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {2982#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2839#false} is VALID [2022-04-07 16:56:37,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {2986#(< (mod (+ main_~x~0 1) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2982#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 16:56:37,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {2986#(< (mod (+ main_~x~0 1) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2986#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:56:37,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {2993#(< (mod (+ main_~x~0 2) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2986#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:56:37,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {2993#(< (mod (+ main_~x~0 2) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2993#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:37,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {3000#(< (mod (+ main_~x~0 3) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2993#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:56:37,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< (mod (+ main_~x~0 3) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3000#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-07 16:56:37,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {3007#(< (mod (+ main_~x~0 4) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3000#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-07 16:56:37,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {3007#(< (mod (+ main_~x~0 4) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3007#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:37,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#(< (mod (+ 5 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3007#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:56:37,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {3014#(< (mod (+ 5 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3014#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:56:37,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {3021#(< (mod (+ main_~x~0 6) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3014#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:56:37,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {3021#(< (mod (+ main_~x~0 6) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3021#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 16:56:37,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {3028#(< (mod (+ 7 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3021#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 16:56:37,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {3028#(< (mod (+ 7 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3028#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:56:37,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {3035#(< (mod (+ main_~x~0 8) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3028#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:56:37,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {3035#(< (mod (+ main_~x~0 8) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3035#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 16:56:37,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {3042#(< (mod (+ main_~x~0 9) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3035#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 16:56:37,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {3042#(< (mod (+ main_~x~0 9) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3042#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-07 16:56:37,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {3049#(< (mod (+ main_~x~0 10) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3042#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-07 16:56:37,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {3049#(< (mod (+ main_~x~0 10) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3049#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 16:56:37,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {3056#(< (mod (+ main_~x~0 11) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3049#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 16:56:37,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {3056#(< (mod (+ main_~x~0 11) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3056#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-07 16:56:37,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {3063#(< (mod (+ main_~x~0 12) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3056#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-07 16:56:37,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {3063#(< (mod (+ main_~x~0 12) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3063#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 16:56:37,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {3070#(< (mod (+ main_~x~0 13) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3063#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 16:56:37,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {3070#(< (mod (+ main_~x~0 13) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3070#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-07 16:56:37,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {2838#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {3070#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-07 16:56:37,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {2838#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2838#true} {2838#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2838#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2838#true} is VALID [2022-04-07 16:56:37,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {2838#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2838#true} is VALID [2022-04-07 16:56:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:37,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589527723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:37,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:37,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-07 16:56:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146972472] [2022-04-07 16:56:37,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-07 16:56:37,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:37,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:37,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:37,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-07 16:56:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:37,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-07 16:56:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-07 16:56:37,658 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:45,939 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-07 16:56:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 16:56:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-07 16:56:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:56:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 91 transitions. [2022-04-07 16:56:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 91 transitions. [2022-04-07 16:56:45,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 91 transitions. [2022-04-07 16:56:46,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:46,111 INFO L225 Difference]: With dead ends: 98 [2022-04-07 16:56:46,111 INFO L226 Difference]: Without dead ends: 98 [2022-04-07 16:56:46,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=985, Invalid=2555, Unknown=0, NotChecked=0, Total=3540 [2022-04-07 16:56:46,113 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 16:56:46,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 93 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 16:56:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-07 16:56:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-07 16:56:46,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:56:46,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:46,115 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:46,116 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:46,117 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-07 16:56:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-04-07 16:56:46,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:46,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:46,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-07 16:56:46,117 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-07 16:56:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:56:46,118 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-07 16:56:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-04-07 16:56:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:56:46,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:56:46,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:56:46,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:56:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-04-07 16:56:46,120 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 37 [2022-04-07 16:56:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:56:46,120 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-04-07 16:56:46,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-04-07 16:56:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 16:56:46,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:56:46,121 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:56:46,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 16:56:46,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:46,337 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:56:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:56:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1208240388, now seen corresponding path program 3 times [2022-04-07 16:56:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:56:46,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011270758] [2022-04-07 16:56:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:56:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:56:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:56:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:46,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {3561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3541#true} is VALID [2022-04-07 16:56:46,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3541#true} {3541#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {3541#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:56:46,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {3561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3541#true} is VALID [2022-04-07 16:56:46,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {3541#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3541#true} {3541#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {3541#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {3541#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {3546#(= main_~x~0 0)} is VALID [2022-04-07 16:56:46,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {3546#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3546#(= main_~x~0 0)} is VALID [2022-04-07 16:56:46,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {3546#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:46,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:46,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:46,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:46,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:46,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:46,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:46,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:46,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:46,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:46,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:46,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:46,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:56:46,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:56:46,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:56:46,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:56:46,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:56:46,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:56:46,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:56:46,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:56:46,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:56:46,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:56:46,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:56:46,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:56:46,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:56:46,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:56:46,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3560#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-07 16:56:46,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {3560#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3542#false} is VALID [2022-04-07 16:56:46,583 INFO L272 TraceCheckUtils]: 35: Hoare triple {3542#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3542#false} is VALID [2022-04-07 16:56:46,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {3542#false} [58] __VERIFIER_assertENTRY-->L7: 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] {3542#false} is VALID [2022-04-07 16:56:46,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {3542#false} [59] L7-->L8: 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[] {3542#false} is VALID [2022-04-07 16:56:46,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {3542#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#false} is VALID [2022-04-07 16:56:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:46,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:56:46,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011270758] [2022-04-07 16:56:46,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011270758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:56:46,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310062325] [2022-04-07 16:56:46,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 16:56:46,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:56:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:56:46,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:56:46,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 16:56:46,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-04-07 16:56:46,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:56:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 16:56:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:56:46,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:56:46,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {3541#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3541#true} is VALID [2022-04-07 16:56:46,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {3541#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3541#true} {3541#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3541#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:46,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {3541#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {3546#(= main_~x~0 0)} is VALID [2022-04-07 16:56:46,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {3546#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3546#(= main_~x~0 0)} is VALID [2022-04-07 16:56:46,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {3546#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:46,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:56:46,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {3547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:46,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:56:46,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {3548#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:46,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:56:46,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {3549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:46,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:56:46,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {3550#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:46,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:56:46,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {3551#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:46,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:56:46,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {3552#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:56:46,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:56:46,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {3553#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:56:46,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:56:46,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {3554#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:56:46,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:56:46,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {3555#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:56:46,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:56:46,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {3556#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:56:46,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:56:46,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {3557#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:56:46,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:56:46,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {3558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:56:46,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:56:46,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3664#(and (<= 28 main_~x~0) (not (= (mod main_~y~0 2) 0)) (<= main_~x~0 28))} is VALID [2022-04-07 16:56:46,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {3664#(and (<= 28 main_~x~0) (not (= (mod main_~y~0 2) 0)) (<= main_~x~0 28))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3542#false} is VALID [2022-04-07 16:56:46,978 INFO L272 TraceCheckUtils]: 35: Hoare triple {3542#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3542#false} is VALID [2022-04-07 16:56:46,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {3542#false} [58] __VERIFIER_assertENTRY-->L7: 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] {3542#false} is VALID [2022-04-07 16:56:46,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {3542#false} [59] L7-->L8: 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[] {3542#false} is VALID [2022-04-07 16:56:46,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {3542#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#false} is VALID [2022-04-07 16:56:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:46,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:56:48,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {3542#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#false} is VALID [2022-04-07 16:56:48,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {3683#(not (<= __VERIFIER_assert_~cond 0))} [59] L7-->L8: 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[] {3542#false} is VALID [2022-04-07 16:56:48,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {3687#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L7: 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] {3683#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:56:48,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {3691#(= (mod main_~x~0 2) (mod main_~y~0 2))} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3687#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:56:48,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {3695#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3691#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-07 16:56:48,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {3699#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3695#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-07 16:56:48,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {3699#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3699#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-07 16:56:48,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {3706#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3699#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-07 16:56:48,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {3706#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3706#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {3713#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3706#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {3713#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3713#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {3720#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3713#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {3720#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3720#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {3727#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3720#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {3727#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3727#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-07 16:56:48,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {3734#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3727#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-07 16:56:48,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {3734#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3734#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-07 16:56:48,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {3741#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3734#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-07 16:56:48,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {3741#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3741#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-07 16:56:48,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {3748#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3741#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-07 16:56:48,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {3748#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3748#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 99))} is VALID [2022-04-07 16:56:48,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {3755#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3748#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 99))} is VALID [2022-04-07 16:56:48,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {3755#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3755#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-07 16:56:48,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {3762#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3755#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-07 16:56:48,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {3762#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3762#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {3769#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3762#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {3769#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3769#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {3776#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3769#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3776#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {3783#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3776#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {3783#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3783#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {3790#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {3783#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-07 16:56:48,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {3790#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3790#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-07 16:56:48,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {3541#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {3790#(or (<= 1 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-07 16:56:48,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {3541#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:48,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3541#true} {3541#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:48,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {3541#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:48,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3541#true} is VALID [2022-04-07 16:56:48,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {3541#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3541#true} is VALID [2022-04-07 16:56:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:56:48,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310062325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:56:48,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:56:48,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 20] total 37 [2022-04-07 16:56:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755364638] [2022-04-07 16:56:48,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:56:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-07 16:56:48,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:56:48,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:56:48,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:56:48,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-07 16:56:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:56:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-07 16:56:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-04-07 16:56:48,086 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:57:17,654 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-07 16:57:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-07 16:57:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-07 16:57:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:57:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 97 transitions. [2022-04-07 16:57:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 97 transitions. [2022-04-07 16:57:17,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 97 transitions. [2022-04-07 16:57:18,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:57:18,029 INFO L225 Difference]: With dead ends: 133 [2022-04-07 16:57:18,029 INFO L226 Difference]: Without dead ends: 129 [2022-04-07 16:57:18,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=1222, Invalid=3890, Unknown=0, NotChecked=0, Total=5112 [2022-04-07 16:57:18,031 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 151 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-07 16:57:18,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 101 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-07 16:57:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-07 16:57:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-07 16:57:18,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:57:18,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:18,034 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:18,034 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:57:18,035 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2022-04-07 16:57:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2022-04-07 16:57:18,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:57:18,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:57:18,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-07 16:57:18,036 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-07 16:57:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:57:18,037 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2022-04-07 16:57:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2022-04-07 16:57:18,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:57:18,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:57:18,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:57:18,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:57:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2022-04-07 16:57:18,039 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 39 [2022-04-07 16:57:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:57:18,039 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2022-04-07 16:57:18,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2022-04-07 16:57:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-07 16:57:18,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:57:18,040 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:57:18,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 16:57:18,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:57:18,244 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:57:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:57:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1642006708, now seen corresponding path program 5 times [2022-04-07 16:57:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:57:18,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990058127] [2022-04-07 16:57:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:57:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:57:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:57:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:57:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:57:18,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {4439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4404#true} is VALID [2022-04-07 16:57:18,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {4404#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:18,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4404#true} {4404#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:18,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {4404#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:57:18,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4404#true} is VALID [2022-04-07 16:57:18,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {4404#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:18,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4404#true} {4404#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:18,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {4404#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:18,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {4404#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {4409#(= main_~x~0 0)} is VALID [2022-04-07 16:57:18,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {4409#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4409#(= main_~x~0 0)} is VALID [2022-04-07 16:57:18,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {4409#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:57:18,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:57:18,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:57:18,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:57:18,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:57:18,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:57:18,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:57:18,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:57:18,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:57:18,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:57:18,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:57:18,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:57:18,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:57:18,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:57:18,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:57:18,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:57:18,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:57:18,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:57:18,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:57:18,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:57:18,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:57:18,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:57:18,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:57:18,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:57:18,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 16:57:18,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 16:57:18,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:57:18,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:57:18,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 16:57:18,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 16:57:18,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:57:18,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:57:18,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 16:57:18,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 16:57:18,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:57:18,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:57:18,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 16:57:18,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 16:57:18,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:57:18,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:57:18,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 16:57:18,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 16:57:18,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:57:18,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:57:18,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 16:57:18,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 16:57:18,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:57:18,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:57:18,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 16:57:18,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 16:57:18,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:57:18,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:57:18,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 16:57:18,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 16:57:18,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 16:57:18,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 16:57:18,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4438#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:57:18,879 INFO L290 TraceCheckUtils]: 64: Hoare triple {4438#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4405#false} is VALID [2022-04-07 16:57:18,879 INFO L272 TraceCheckUtils]: 65: Hoare triple {4405#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4405#false} is VALID [2022-04-07 16:57:18,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {4405#false} [58] __VERIFIER_assertENTRY-->L7: 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] {4405#false} is VALID [2022-04-07 16:57:18,880 INFO L290 TraceCheckUtils]: 67: Hoare triple {4405#false} [59] L7-->L8: 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[] {4405#false} is VALID [2022-04-07 16:57:18,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {4405#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4405#false} is VALID [2022-04-07 16:57:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:57:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:57:18,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990058127] [2022-04-07 16:57:18,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990058127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:57:18,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406239599] [2022-04-07 16:57:18,880 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 16:57:18,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:57:18,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:57:18,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:57:18,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 16:57:29,878 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2022-04-07 16:57:29,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:57:29,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-07 16:57:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:57:29,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:57:30,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {4404#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:30,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {4404#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4404#true} is VALID [2022-04-07 16:57:30,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {4404#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:30,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4404#true} {4404#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:30,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {4404#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:30,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {4404#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {4409#(= main_~x~0 0)} is VALID [2022-04-07 16:57:30,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {4409#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4409#(= main_~x~0 0)} is VALID [2022-04-07 16:57:30,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {4409#(= main_~x~0 0)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:57:30,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 16:57:30,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {4410#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:57:30,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 16:57:30,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {4411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:57:30,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 16:57:30,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {4412#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:57:30,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 16:57:30,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {4413#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:57:30,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 16:57:30,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {4414#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:57:30,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 16:57:30,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {4415#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:57:30,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 16:57:30,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {4416#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:57:30,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 16:57:30,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {4417#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:57:30,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 16:57:30,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {4418#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:57:30,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 16:57:30,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:57:30,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 16:57:30,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {4420#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:57:30,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 16:57:30,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {4421#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 16:57:30,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 16:57:30,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {4422#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:57:30,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 16:57:30,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {4423#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 16:57:30,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 16:57:30,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {4424#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:57:30,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 16:57:30,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {4425#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 16:57:30,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 16:57:30,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {4426#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:57:30,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 16:57:30,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {4427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 16:57:30,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 16:57:30,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {4428#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:57:30,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 16:57:30,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {4429#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 16:57:30,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 16:57:30,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {4430#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:57:30,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 16:57:30,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {4431#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 16:57:30,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 16:57:30,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {4432#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:57:30,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 16:57:30,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {4433#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 16:57:30,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 16:57:30,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {4434#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:57:30,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 16:57:30,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {4435#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 16:57:30,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 16:57:30,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {4436#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 16:57:30,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 16:57:30,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {4437#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4632#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 16:57:30,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {4632#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4405#false} is VALID [2022-04-07 16:57:30,485 INFO L272 TraceCheckUtils]: 65: Hoare triple {4405#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4405#false} is VALID [2022-04-07 16:57:30,485 INFO L290 TraceCheckUtils]: 66: Hoare triple {4405#false} [58] __VERIFIER_assertENTRY-->L7: 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] {4405#false} is VALID [2022-04-07 16:57:30,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {4405#false} [59] L7-->L8: 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[] {4405#false} is VALID [2022-04-07 16:57:30,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {4405#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4405#false} is VALID [2022-04-07 16:57:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:57:30,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:57:31,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {4405#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4405#false} is VALID [2022-04-07 16:57:31,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {4405#false} [59] L7-->L8: 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[] {4405#false} is VALID [2022-04-07 16:57:31,974 INFO L290 TraceCheckUtils]: 66: Hoare triple {4405#false} [58] __VERIFIER_assertENTRY-->L7: 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] {4405#false} is VALID [2022-04-07 16:57:31,974 INFO L272 TraceCheckUtils]: 65: Hoare triple {4405#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4405#false} is VALID [2022-04-07 16:57:31,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {4660#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4405#false} is VALID [2022-04-07 16:57:31,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {4664#(< (mod (+ main_~x~0 1) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4660#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 16:57:31,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {4664#(< (mod (+ main_~x~0 1) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4664#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:57:31,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {4671#(< (mod (+ main_~x~0 2) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4664#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-07 16:57:31,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {4671#(< (mod (+ main_~x~0 2) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4671#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:57:31,977 INFO L290 TraceCheckUtils]: 59: Hoare triple {4678#(< (mod (+ main_~x~0 3) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4671#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 16:57:31,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {4678#(< (mod (+ main_~x~0 3) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4678#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-07 16:57:31,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {4685#(< (mod (+ main_~x~0 4) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4678#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-07 16:57:31,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {4685#(< (mod (+ main_~x~0 4) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4685#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:57:31,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {4692#(< (mod (+ 5 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4685#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 16:57:31,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {4692#(< (mod (+ 5 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4692#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {4699#(< (mod (+ main_~x~0 6) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4692#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {4699#(< (mod (+ main_~x~0 6) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4699#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 16:57:31,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {4706#(< (mod (+ 7 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4699#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 16:57:31,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {4706#(< (mod (+ 7 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4706#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {4713#(< (mod (+ main_~x~0 8) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4706#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {4713#(< (mod (+ main_~x~0 8) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4713#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 16:57:31,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {4720#(< (mod (+ main_~x~0 9) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4713#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 16:57:31,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {4720#(< (mod (+ main_~x~0 9) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4720#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-07 16:57:31,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {4727#(< (mod (+ main_~x~0 10) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4720#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-07 16:57:31,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {4727#(< (mod (+ main_~x~0 10) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4727#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 16:57:31,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {4734#(< (mod (+ main_~x~0 11) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4727#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 16:57:31,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {4734#(< (mod (+ main_~x~0 11) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4734#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-07 16:57:31,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {4741#(< (mod (+ main_~x~0 12) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4734#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-07 16:57:31,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {4741#(< (mod (+ main_~x~0 12) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4741#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 16:57:31,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {4748#(< (mod (+ main_~x~0 13) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4741#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 16:57:31,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {4748#(< (mod (+ main_~x~0 13) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4748#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-07 16:57:31,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {4755#(< (mod (+ main_~x~0 14) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4748#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-07 16:57:31,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {4755#(< (mod (+ main_~x~0 14) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4755#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-07 16:57:31,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#(< (mod (+ main_~x~0 15) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4755#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-07 16:57:31,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#(< (mod (+ main_~x~0 15) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4762#(< (mod (+ main_~x~0 15) 4294967296) 99)} is VALID [2022-04-07 16:57:31,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {4769#(< (mod (+ main_~x~0 16) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4762#(< (mod (+ main_~x~0 15) 4294967296) 99)} is VALID [2022-04-07 16:57:31,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {4769#(< (mod (+ main_~x~0 16) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4769#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-07 16:57:31,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {4776#(< (mod (+ main_~x~0 17) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4769#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-07 16:57:31,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {4776#(< (mod (+ main_~x~0 17) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4776#(< (mod (+ main_~x~0 17) 4294967296) 99)} is VALID [2022-04-07 16:57:31,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {4783#(< (mod (+ main_~x~0 18) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4776#(< (mod (+ main_~x~0 17) 4294967296) 99)} is VALID [2022-04-07 16:57:31,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {4783#(< (mod (+ main_~x~0 18) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4783#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-07 16:57:31,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {4790#(< (mod (+ 19 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4783#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-07 16:57:31,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {4790#(< (mod (+ 19 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4790#(< (mod (+ 19 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(< (mod (+ main_~x~0 20) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4790#(< (mod (+ 19 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(< (mod (+ main_~x~0 20) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4797#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-07 16:57:31,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {4804#(< (mod (+ main_~x~0 21) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4797#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-07 16:57:31,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {4804#(< (mod (+ main_~x~0 21) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4804#(< (mod (+ main_~x~0 21) 4294967296) 99)} is VALID [2022-04-07 16:57:31,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {4811#(< (mod (+ main_~x~0 22) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4804#(< (mod (+ main_~x~0 21) 4294967296) 99)} is VALID [2022-04-07 16:57:31,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {4811#(< (mod (+ main_~x~0 22) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4811#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-07 16:57:31,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#(< (mod (+ 23 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4811#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-07 16:57:31,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#(< (mod (+ 23 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4818#(< (mod (+ 23 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {4825#(< (mod (+ main_~x~0 24) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4818#(< (mod (+ 23 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:31,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {4825#(< (mod (+ main_~x~0 24) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4825#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-07 16:57:31,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {4832#(< (mod (+ main_~x~0 25) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4825#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-07 16:57:31,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {4832#(< (mod (+ main_~x~0 25) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4832#(< (mod (+ main_~x~0 25) 4294967296) 99)} is VALID [2022-04-07 16:57:31,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {4839#(< (mod (+ main_~x~0 26) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4832#(< (mod (+ main_~x~0 25) 4294967296) 99)} is VALID [2022-04-07 16:57:31,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {4839#(< (mod (+ main_~x~0 26) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4839#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-07 16:57:31,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {4846#(< (mod (+ main_~x~0 27) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4839#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-07 16:57:31,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {4846#(< (mod (+ main_~x~0 27) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4846#(< (mod (+ main_~x~0 27) 4294967296) 99)} is VALID [2022-04-07 16:57:31,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {4853#(< (mod (+ main_~x~0 28) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4846#(< (mod (+ main_~x~0 27) 4294967296) 99)} is VALID [2022-04-07 16:57:31,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {4853#(< (mod (+ main_~x~0 28) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4853#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-07 16:57:32,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {4860#(< (mod (+ 29 main_~x~0) 4294967296) 99)} [55] L18-->L18-2: Formula: (and (= (mod v_main_~y~0_4 2) 0) (= v_main_~x~0_7 (+ v_main_~x~0_8 1))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4853#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-07 16:57:32,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {4860#(< (mod (+ 29 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4860#(< (mod (+ 29 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:32,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {4404#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {4860#(< (mod (+ 29 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 16:57:32,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {4404#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:32,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4404#true} {4404#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:32,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {4404#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:32,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {4404#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4404#true} is VALID [2022-04-07 16:57:32,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {4404#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#true} is VALID [2022-04-07 16:57:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:57:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406239599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:57:32,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:57:32,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-07 16:57:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147111615] [2022-04-07 16:57:32,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:57:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-07 16:57:32,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:57:32,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:57:32,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:57:32,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-07 16:57:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:57:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-07 16:57:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-07 16:57:32,101 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:35,596 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2022-04-07 17:00:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-07 17:00:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-07 17:00:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:00:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 179 transitions. [2022-04-07 17:00:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 179 transitions. [2022-04-07 17:00:35,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 179 transitions. [2022-04-07 17:00:36,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:36,029 INFO L225 Difference]: With dead ends: 194 [2022-04-07 17:00:36,029 INFO L226 Difference]: Without dead ends: 194 [2022-04-07 17:00:36,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 179.7s TimeCoverageRelationStatistics Valid=4025, Invalid=11227, Unknown=0, NotChecked=0, Total=15252 [2022-04-07 17:00:36,033 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-07 17:00:36,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 163 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-07 17:00:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-07 17:00:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2022-04-07 17:00:36,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:00:36,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:36,038 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:36,039 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:36,041 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2022-04-07 17:00:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2022-04-07 17:00:36,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:36,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:36,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-07 17:00:36,042 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-07 17:00:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:00:36,050 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2022-04-07 17:00:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2022-04-07 17:00:36,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:00:36,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:00:36,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:00:36,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:00:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.0159574468085106) internal successors, (191), 188 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2022-04-07 17:00:36,053 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 69 [2022-04-07 17:00:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:00:36,054 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2022-04-07 17:00:36,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2022-04-07 17:00:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-07 17:00:36,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:00:36,056 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:00:36,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 17:00:36,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 17:00:36,262 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:00:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:00:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1425056564, now seen corresponding path program 4 times [2022-04-07 17:00:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:00:36,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394076374] [2022-04-07 17:00:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:00:36,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:00:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:00:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:36,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {5815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5779#true} is VALID [2022-04-07 17:00:36,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {5779#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:36,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5779#true} {5779#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:36,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {5779#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:00:36,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {5815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5779#true} is VALID [2022-04-07 17:00:36,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {5779#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:36,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5779#true} {5779#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:36,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {5779#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:36,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {5779#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {5784#(= main_~x~0 0)} is VALID [2022-04-07 17:00:36,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {5784#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5784#(= main_~x~0 0)} is VALID [2022-04-07 17:00:36,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {5784#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:00:36,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:00:36,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:00:36,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:00:36,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:00:36,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:00:36,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:00:36,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:00:36,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:00:36,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:00:36,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:00:36,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:00:36,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:00:36,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:00:36,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:00:36,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:00:36,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:00:36,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:00:36,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:00:36,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:00:36,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:00:36,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:00:36,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:00:36,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:00:36,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 17:00:36,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 17:00:36,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 17:00:36,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 17:00:36,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 17:00:36,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 17:00:36,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 17:00:36,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 17:00:36,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 17:00:36,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 17:00:36,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 17:00:36,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 17:00:36,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 17:00:36,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 17:00:36,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 17:00:36,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 17:00:36,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-07 17:00:36,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-07 17:00:36,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-07 17:00:36,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-07 17:00:36,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-07 17:00:36,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-07 17:00:36,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-07 17:00:36,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-07 17:00:36,962 INFO L290 TraceCheckUtils]: 55: Hoare triple {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-07 17:00:36,962 INFO L290 TraceCheckUtils]: 56: Hoare triple {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-07 17:00:36,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-07 17:00:36,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-07 17:00:36,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-07 17:00:36,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-07 17:00:36,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-07 17:00:36,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-07 17:00:36,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-07 17:00:36,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-07 17:00:36,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5814#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:00:36,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {5814#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5780#false} is VALID [2022-04-07 17:00:36,966 INFO L272 TraceCheckUtils]: 67: Hoare triple {5780#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5780#false} is VALID [2022-04-07 17:00:36,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {5780#false} [58] __VERIFIER_assertENTRY-->L7: 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] {5780#false} is VALID [2022-04-07 17:00:36,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {5780#false} [59] L7-->L8: 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[] {5780#false} is VALID [2022-04-07 17:00:36,966 INFO L290 TraceCheckUtils]: 70: Hoare triple {5780#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5780#false} is VALID [2022-04-07 17:00:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:00:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:00:36,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394076374] [2022-04-07 17:00:36,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394076374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:00:36,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430427703] [2022-04-07 17:00:36,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 17:00:36,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:00:36,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:00:36,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:00:37,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 17:00:37,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 17:00:37,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:00:37,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-07 17:00:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:00:37,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:00:37,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {5779#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:37,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {5779#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5779#true} is VALID [2022-04-07 17:00:37,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {5779#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:37,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5779#true} {5779#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:37,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {5779#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:37,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {5779#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {5784#(= main_~x~0 0)} is VALID [2022-04-07 17:00:37,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {5784#(= main_~x~0 0)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5784#(= main_~x~0 0)} is VALID [2022-04-07 17:00:37,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {5784#(= main_~x~0 0)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:00:37,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:00:37,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {5785#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:00:37,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:00:37,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {5786#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:00:37,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:00:37,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {5787#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:00:37,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:00:37,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {5788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:00:37,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:00:37,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {5789#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:00:37,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:00:37,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {5790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:00:37,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:00:37,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {5791#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:00:37,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:00:37,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {5792#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:00:37,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:00:37,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:00:37,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:00:37,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {5794#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:00:37,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:00:37,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {5795#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:00:37,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:00:37,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {5796#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 17:00:37,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 17:00:37,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {5797#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 17:00:37,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 17:00:37,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {5798#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 17:00:37,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 17:00:37,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {5799#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 17:00:37,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 17:00:37,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {5800#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 17:00:37,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 17:00:37,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {5801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 17:00:37,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 17:00:37,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {5802#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 17:00:37,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 17:00:37,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {5803#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 17:00:37,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 17:00:37,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {5804#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-07 17:00:37,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-07 17:00:37,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {5805#(and (<= main_~x~0 42) (<= 42 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-07 17:00:37,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-07 17:00:37,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {5806#(and (<= 44 main_~x~0) (<= main_~x~0 44))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-07 17:00:37,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-07 17:00:37,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {5807#(and (<= 46 main_~x~0) (<= main_~x~0 46))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-07 17:00:37,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-07 17:00:37,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {5808#(and (<= main_~x~0 48) (<= 48 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-07 17:00:37,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-07 17:00:37,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {5809#(and (<= main_~x~0 50) (<= 50 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-07 17:00:37,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-07 17:00:37,825 INFO L290 TraceCheckUtils]: 59: Hoare triple {5810#(and (<= main_~x~0 52) (<= 52 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-07 17:00:37,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-07 17:00:37,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {5811#(and (<= main_~x~0 54) (<= 54 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-07 17:00:37,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-07 17:00:37,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {5812#(and (<= main_~x~0 56) (<= 56 main_~x~0))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-07 17:00:37,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-07 17:00:37,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {5813#(and (<= 58 main_~x~0) (<= main_~x~0 58))} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6014#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-07 17:00:37,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {6014#(and (<= main_~x~0 60) (<= 60 main_~x~0))} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5780#false} is VALID [2022-04-07 17:00:37,827 INFO L272 TraceCheckUtils]: 67: Hoare triple {5780#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5780#false} is VALID [2022-04-07 17:00:37,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {5780#false} [58] __VERIFIER_assertENTRY-->L7: 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] {5780#false} is VALID [2022-04-07 17:00:37,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {5780#false} [59] L7-->L8: 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[] {5780#false} is VALID [2022-04-07 17:00:37,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {5780#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5780#false} is VALID [2022-04-07 17:00:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:00:37,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:00:39,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {5780#false} [61] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5780#false} is VALID [2022-04-07 17:00:39,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {5780#false} [59] L7-->L8: 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[] {5780#false} is VALID [2022-04-07 17:00:39,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {5780#false} [58] __VERIFIER_assertENTRY-->L7: 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] {5780#false} is VALID [2022-04-07 17:00:39,231 INFO L272 TraceCheckUtils]: 67: Hoare triple {5780#false} [54] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) (mod v_main_~y~0_5 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5780#false} is VALID [2022-04-07 17:00:39,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {6042#(< (mod main_~x~0 4294967296) 99)} [52] L18-2-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5780#false} is VALID [2022-04-07 17:00:39,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {6046#(< (mod (+ main_~x~0 2) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6042#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-07 17:00:39,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {6046#(< (mod (+ main_~x~0 2) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6046#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 17:00:39,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {6053#(< (mod (+ main_~x~0 4) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6046#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-07 17:00:39,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {6053#(< (mod (+ main_~x~0 4) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6053#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 17:00:39,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {6060#(< (mod (+ main_~x~0 6) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6053#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-07 17:00:39,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {6060#(< (mod (+ main_~x~0 6) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6060#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 17:00:39,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {6067#(< (mod (+ main_~x~0 8) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6060#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-07 17:00:39,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {6067#(< (mod (+ main_~x~0 8) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6067#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 17:00:39,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {6074#(< (mod (+ main_~x~0 10) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6067#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-07 17:00:39,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {6074#(< (mod (+ main_~x~0 10) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6074#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 17:00:39,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {6081#(< (mod (+ main_~x~0 12) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6074#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-07 17:00:39,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {6081#(< (mod (+ main_~x~0 12) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6081#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 17:00:39,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {6088#(< (mod (+ main_~x~0 14) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6081#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-07 17:00:39,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {6088#(< (mod (+ main_~x~0 14) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6088#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-07 17:00:39,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {6095#(< (mod (+ main_~x~0 16) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6088#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-07 17:00:39,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {6095#(< (mod (+ main_~x~0 16) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6095#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-07 17:00:39,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {6102#(< (mod (+ main_~x~0 18) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6095#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-07 17:00:39,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {6102#(< (mod (+ main_~x~0 18) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6102#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-07 17:00:39,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {6109#(< (mod (+ main_~x~0 20) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6102#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-07 17:00:39,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {6109#(< (mod (+ main_~x~0 20) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6109#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-07 17:00:39,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {6116#(< (mod (+ main_~x~0 22) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6109#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-07 17:00:39,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {6116#(< (mod (+ main_~x~0 22) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6116#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-07 17:00:39,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {6123#(< (mod (+ main_~x~0 24) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6116#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-07 17:00:39,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {6123#(< (mod (+ main_~x~0 24) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6123#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-07 17:00:39,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {6130#(< (mod (+ main_~x~0 26) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6123#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-07 17:00:39,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {6130#(< (mod (+ main_~x~0 26) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6130#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-07 17:00:39,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {6137#(< (mod (+ main_~x~0 28) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6130#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-07 17:00:39,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {6137#(< (mod (+ main_~x~0 28) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6137#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-07 17:00:39,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {6144#(< (mod (+ 30 main_~x~0) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6137#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-07 17:00:39,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {6144#(< (mod (+ 30 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6144#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {6151#(< (mod (+ 32 main_~x~0) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6144#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {6151#(< (mod (+ 32 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6151#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {6158#(< (mod (+ main_~x~0 34) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6151#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {6158#(< (mod (+ main_~x~0 34) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6158#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-07 17:00:39,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {6165#(< (mod (+ main_~x~0 36) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6158#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-07 17:00:39,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {6165#(< (mod (+ main_~x~0 36) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6165#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-07 17:00:39,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(< (mod (+ main_~x~0 38) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6165#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-07 17:00:39,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(< (mod (+ main_~x~0 38) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6172#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-07 17:00:39,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {6179#(< (mod (+ 40 main_~x~0) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6172#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-07 17:00:39,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {6179#(< (mod (+ 40 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6179#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {6186#(< (mod (+ 42 main_~x~0) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6179#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {6186#(< (mod (+ 42 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6186#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {6193#(< (mod (+ 44 main_~x~0) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6186#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {6193#(< (mod (+ 44 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6193#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {6200#(< (mod (+ main_~x~0 46) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6193#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {6200#(< (mod (+ main_~x~0 46) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6200#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-07 17:00:39,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {6207#(< (mod (+ main_~x~0 48) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6200#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-07 17:00:39,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {6207#(< (mod (+ main_~x~0 48) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6207#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-07 17:00:39,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {6214#(< (mod (+ main_~x~0 50) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6207#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-07 17:00:39,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {6214#(< (mod (+ main_~x~0 50) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6214#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-07 17:00:39,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {6221#(< (mod (+ main_~x~0 52) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6214#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-07 17:00:39,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {6221#(< (mod (+ main_~x~0 52) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6221#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-07 17:00:39,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {6228#(< (mod (+ main_~x~0 54) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6221#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-07 17:00:39,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {6228#(< (mod (+ main_~x~0 54) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6228#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-07 17:00:39,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {6235#(< (mod (+ 56 main_~x~0) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6228#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-07 17:00:39,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {6235#(< (mod (+ 56 main_~x~0) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6235#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {6242#(< (mod (+ main_~x~0 58) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6235#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-07 17:00:39,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {6242#(< (mod (+ main_~x~0 58) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6242#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-07 17:00:39,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {6249#(< (mod (+ main_~x~0 60) 4294967296) 99)} [56] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 2))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {6242#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-07 17:00:39,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {6249#(< (mod (+ main_~x~0 60) 4294967296) 99)} [53] L18-2-->L18: Formula: (< (mod v_main_~x~0_6 4294967296) 99) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6249#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-07 17:00:39,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {5779#true} [49] mainENTRY-->L18-2: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {6249#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-07 17:00:39,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {5779#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:39,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5779#true} {5779#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:39,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {5779#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:39,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {5779#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5779#true} is VALID [2022-04-07 17:00:39,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {5779#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#true} is VALID [2022-04-07 17:00:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:00:39,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430427703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:00:39,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:00:39,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-07 17:00:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114171608] [2022-04-07 17:00:39,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:00:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-07 17:00:39,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:00:39,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:00:39,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:00:39,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-07 17:00:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:00:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-07 17:00:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=3215, Unknown=0, NotChecked=0, Total=4290 [2022-04-07 17:00:39,364 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:30,540 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2022-04-07 17:01:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-07 17:01:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-07 17:01:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:01:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 176 transitions. [2022-04-07 17:01:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 176 transitions. [2022-04-07 17:01:30,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 176 transitions. [2022-04-07 17:01:30,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:01:30,923 INFO L225 Difference]: With dead ends: 233 [2022-04-07 17:01:30,923 INFO L226 Difference]: Without dead ends: 233 [2022-04-07 17:01:30,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=4085, Invalid=12170, Unknown=1, NotChecked=0, Total=16256 [2022-04-07 17:01:30,927 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:01:30,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 178 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-07 17:01:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-07 17:01:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-04-07 17:01:30,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:01:30,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 233 states, 228 states have (on average 1.013157894736842) internal successors, (231), 228 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,930 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 233 states, 228 states have (on average 1.013157894736842) internal successors, (231), 228 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,931 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 233 states, 228 states have (on average 1.013157894736842) internal successors, (231), 228 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:30,934 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2022-04-07 17:01:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 235 transitions. [2022-04-07 17:01:30,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:30,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:30,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 228 states have (on average 1.013157894736842) internal successors, (231), 228 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-07 17:01:30,934 INFO L87 Difference]: Start difference. First operand has 233 states, 228 states have (on average 1.013157894736842) internal successors, (231), 228 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-07 17:01:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:01:30,937 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2022-04-07 17:01:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 235 transitions. [2022-04-07 17:01:30,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:01:30,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:01:30,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:01:30,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:01:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.013157894736842) internal successors, (231), 228 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 235 transitions. [2022-04-07 17:01:30,941 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 235 transitions. Word has length 71 [2022-04-07 17:01:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:01:30,941 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 235 transitions. [2022-04-07 17:01:30,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:01:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 235 transitions. [2022-04-07 17:01:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-07 17:01:30,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:01:30,942 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:01:30,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 17:01:31,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 17:01:31,156 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:01:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:01:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 843717136, now seen corresponding path program 5 times [2022-04-07 17:01:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:01:31,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430639066] [2022-04-07 17:01:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:01:31,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:01:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 17:01:31,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 17:01:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 17:01:31,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 17:01:31,308 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 17:01:31,309 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:01:31,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 17:01:31,329 INFO L719 BasicCegarLoop]: Path program histogram: [5, 5, 2, 1, 1] [2022-04-07 17:01:31,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:01:31,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:01:31 BasicIcfg [2022-04-07 17:01:31,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:01:31,366 INFO L158 Benchmark]: Toolchain (without parser) took 304847.25ms. Allocated memory was 207.6MB in the beginning and 305.1MB in the end (delta: 97.5MB). Free memory was 154.6MB in the beginning and 123.1MB in the end (delta: 31.4MB). Peak memory consumption was 128.1MB. Max. memory is 8.0GB. [2022-04-07 17:01:31,366 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:01:31,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.31ms. Allocated memory is still 207.6MB. Free memory was 154.3MB in the beginning and 182.9MB in the end (delta: -28.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 17:01:31,367 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 207.6MB. Free memory was 182.9MB in the beginning and 181.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:01:31,367 INFO L158 Benchmark]: RCFGBuilder took 208.89ms. Allocated memory is still 207.6MB. Free memory was 181.3MB in the beginning and 170.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 17:01:31,367 INFO L158 Benchmark]: IcfgTransformer took 16.47ms. Allocated memory is still 207.6MB. Free memory was 170.8MB in the beginning and 169.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:01:31,367 INFO L158 Benchmark]: TraceAbstraction took 304409.09ms. Allocated memory was 207.6MB in the beginning and 305.1MB in the end (delta: 97.5MB). Free memory was 169.1MB in the beginning and 123.1MB in the end (delta: 46.0MB). Peak memory consumption was 144.6MB. Max. memory is 8.0GB. [2022-04-07 17:01:31,368 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 207.6MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.31ms. Allocated memory is still 207.6MB. Free memory was 154.3MB in the beginning and 182.9MB in the end (delta: -28.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 207.6MB. Free memory was 182.9MB in the beginning and 181.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 208.89ms. Allocated memory is still 207.6MB. Free memory was 181.3MB in the beginning and 170.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.47ms. Allocated memory is still 207.6MB. Free memory was 170.8MB in the beginning and 169.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 304409.09ms. Allocated memory was 207.6MB in the beginning and 305.1MB in the end (delta: 97.5MB). Free memory was 169.1MB in the beginning and 123.1MB in the end (delta: 46.0MB). Peak memory consumption was 144.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] unsigned int x = 0; [L15] unsigned int y = __VERIFIER_nondet_uint(); [L17] COND TRUE x < 99 VAL [x=0, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=2, y=4294967295] [L17] COND TRUE x < 99 VAL [x=2, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=4, y=4294967295] [L17] COND TRUE x < 99 VAL [x=4, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=6, y=4294967295] [L17] COND TRUE x < 99 VAL [x=6, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=8, y=4294967295] [L17] COND TRUE x < 99 VAL [x=8, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=10, y=4294967295] [L17] COND TRUE x < 99 VAL [x=10, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=12, y=4294967295] [L17] COND TRUE x < 99 VAL [x=12, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=14, y=4294967295] [L17] COND TRUE x < 99 VAL [x=14, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=16, y=4294967295] [L17] COND TRUE x < 99 VAL [x=16, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=18, y=4294967295] [L17] COND TRUE x < 99 VAL [x=18, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=20, y=4294967295] [L17] COND TRUE x < 99 VAL [x=20, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=22, y=4294967295] [L17] COND TRUE x < 99 VAL [x=22, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=24, y=4294967295] [L17] COND TRUE x < 99 VAL [x=24, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=26, y=4294967295] [L17] COND TRUE x < 99 VAL [x=26, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=28, y=4294967295] [L17] COND TRUE x < 99 VAL [x=28, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=30, y=4294967295] [L17] COND TRUE x < 99 VAL [x=30, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=32, y=4294967295] [L17] COND TRUE x < 99 VAL [x=32, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=34, y=4294967295] [L17] COND TRUE x < 99 VAL [x=34, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=36, y=4294967295] [L17] COND TRUE x < 99 VAL [x=36, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=38, y=4294967295] [L17] COND TRUE x < 99 VAL [x=38, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=40, y=4294967295] [L17] COND TRUE x < 99 VAL [x=40, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=42, y=4294967295] [L17] COND TRUE x < 99 VAL [x=42, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=44, y=4294967295] [L17] COND TRUE x < 99 VAL [x=44, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=46, y=4294967295] [L17] COND TRUE x < 99 VAL [x=46, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=48, y=4294967295] [L17] COND TRUE x < 99 VAL [x=48, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=50, y=4294967295] [L17] COND TRUE x < 99 VAL [x=50, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=52, y=4294967295] [L17] COND TRUE x < 99 VAL [x=52, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=54, y=4294967295] [L17] COND TRUE x < 99 VAL [x=54, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=56, y=4294967295] [L17] COND TRUE x < 99 VAL [x=56, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=58, y=4294967295] [L17] COND TRUE x < 99 VAL [x=58, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=60, y=4294967295] [L17] COND TRUE x < 99 VAL [x=60, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=62, y=4294967295] [L17] COND TRUE x < 99 VAL [x=62, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=64, y=4294967295] [L17] COND TRUE x < 99 VAL [x=64, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=66, y=4294967295] [L17] COND TRUE x < 99 VAL [x=66, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=68, y=4294967295] [L17] COND TRUE x < 99 VAL [x=68, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=70, y=4294967295] [L17] COND TRUE x < 99 VAL [x=70, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=72, y=4294967295] [L17] COND TRUE x < 99 VAL [x=72, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=74, y=4294967295] [L17] COND TRUE x < 99 VAL [x=74, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=76, y=4294967295] [L17] COND TRUE x < 99 VAL [x=76, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=78, y=4294967295] [L17] COND TRUE x < 99 VAL [x=78, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=80, y=4294967295] [L17] COND TRUE x < 99 VAL [x=80, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=82, y=4294967295] [L17] COND TRUE x < 99 VAL [x=82, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=84, y=4294967295] [L17] COND TRUE x < 99 VAL [x=84, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=86, y=4294967295] [L17] COND TRUE x < 99 VAL [x=86, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=88, y=4294967295] [L17] COND TRUE x < 99 VAL [x=88, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=90, y=4294967295] [L17] COND TRUE x < 99 VAL [x=90, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=92, y=4294967295] [L17] COND TRUE x < 99 VAL [x=92, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=94, y=4294967295] [L17] COND TRUE x < 99 VAL [x=94, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=96, y=4294967295] [L17] COND TRUE x < 99 VAL [x=96, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=98, y=4294967295] [L17] COND TRUE x < 99 VAL [x=98, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=100, y=4294967295] [L17] COND FALSE !(x < 99) VAL [x=100, y=4294967295] [L25] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 304.3s, OverallIterations: 14, TraceHistogramMax: 50, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 278.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 841 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 1695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6861 IncrementalHoareTripleChecker+Invalid, 8556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1695 mSolverCounterUnsat, 159 mSDtfsCounter, 6861 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 554 SyntacticMatches, 9 SemanticMatches, 512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6660 ImplicationChecksByTransitivity, 263.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=13, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1022 ConstructedInterpolants, 0 QuantifiedInterpolants, 5490 SizeOfPredicates, 10 NumberOfNonLiveVariables, 985 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 262/7150 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 17:01:31,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...