/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/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 18:57:24,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:57:24,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:57:24,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:57:24,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:57:24,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:57:24,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:57:24,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:57:24,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:57:24,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:57:24,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:57:24,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:57:24,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:57:24,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:57:24,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:57:24,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:57:24,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:57:24,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:57:24,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:57:24,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:57:24,120 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:57:24,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:57:24,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:57:24,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:57:24,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:57:24,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:57:24,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:57:24,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:57:24,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:57:24,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:57:24,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:57:24,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:57:24,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:57:24,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:57:24,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:57:24,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:57:24,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:57:24,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:57:24,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:57:24,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:57:24,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:57:24,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:57:24,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 18:57:24,143 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:57:24,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:57:24,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:57:24,145 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:57:24,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:57:24,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:57:24,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:57:24,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:57:24,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:57:24,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:57:24,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:57:24,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:57:24,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:57:24,147 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 18:57:24,147 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 18:57:24,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:57:24,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:57:24,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:57:24,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:57:24,352 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:57:24,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-14 18:57:24,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cddb4ab/4c214c88ab774ff9808fac5e59316492/FLAG1f8356349 [2022-04-14 18:57:24,742 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:57:24,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-14 18:57:24,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cddb4ab/4c214c88ab774ff9808fac5e59316492/FLAG1f8356349 [2022-04-14 18:57:24,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cddb4ab/4c214c88ab774ff9808fac5e59316492 [2022-04-14 18:57:24,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:57:24,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 18:57:24,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:57:24,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:57:24,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:57:24,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bade0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24, skipping insertion in model container [2022-04-14 18:57:24,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:57:24,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:57:24,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-14 18:57:24,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:57:24,891 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:57:24,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-14 18:57:24,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:57:24,913 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:57:24,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24 WrapperNode [2022-04-14 18:57:24,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:57:24,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:57:24,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:57:24,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:57:24,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:57:24,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:57:24,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:57:24,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:57:24,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (1/1) ... [2022-04-14 18:57:24,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:57:24,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:24,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 18:57:24,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 18:57:24,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:57:24,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:57:24,990 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:57:24,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 18:57:24,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:57:24,991 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:57:24,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:57:24,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 18:57:24,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 18:57:24,992 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:57:24,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:57:24,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 18:57:24,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 18:57:24,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:57:24,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:57:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:57:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:57:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:57:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:57:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:57:25,040 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:57:25,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:57:25,166 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:57:25,170 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:57:25,171 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 18:57:25,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:57:25 BoogieIcfgContainer [2022-04-14 18:57:25,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:57:25,172 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 18:57:25,172 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 18:57:25,173 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 18:57:25,175 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,178 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 18:57:25,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:57:25 BasicIcfg [2022-04-14 18:57:25,196 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 18:57:25,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:57:25,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:57:25,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:57:25,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:57:24" (1/4) ... [2022-04-14 18:57:25,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3ebfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:57:25, skipping insertion in model container [2022-04-14 18:57:25,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:24" (2/4) ... [2022-04-14 18:57:25,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3ebfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:57:25, skipping insertion in model container [2022-04-14 18:57:25,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:57:25" (3/4) ... [2022-04-14 18:57:25,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3ebfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:57:25, skipping insertion in model container [2022-04-14 18:57:25,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:57:25" (4/4) ... [2022-04-14 18:57:25,204 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.iJordan [2022-04-14 18:57:25,207 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:57:25,207 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:57:25,237 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:57:25,252 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 18:57:25,252 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:57:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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-14 18:57:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 18:57:25,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:25,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:25,277 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1546198667, now seen corresponding path program 1 times [2022-04-14 18:57:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:25,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160129733] [2022-04-14 18:57:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:25,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:25,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 18:57:25,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:25,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:25,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:25,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 18:57:25,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:25,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:25,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:25,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-14 18:57:25,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-14 18:57:25,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:25,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-14 18:57:25,677 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 18:57:25,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 18:57:25,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 18:57:25,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 18:57:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:25,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160129733] [2022-04-14 18:57:25,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160129733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:57:25,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:57:25,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 18:57:25,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034638269] [2022-04-14 18:57:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:57:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-14 18:57:25,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:25,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-14 18:57:25,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:25,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 18:57:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 18:57:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-14 18:57:25,736 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-14 18:57:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:26,046 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-14 18:57:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 18:57:26,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-14 18:57:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-14 18:57:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-14 18:57:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-14 18:57:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-14 18:57:26,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-14 18:57:26,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:26,104 INFO L225 Difference]: With dead ends: 27 [2022-04-14 18:57:26,104 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 18:57:26,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-14 18:57:26,107 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:26,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 18:57:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 18:57:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-14 18:57:26,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:26,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 18:57:26,130 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 18:57:26,130 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 18:57:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:26,134 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-14 18:57:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-14 18:57:26,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:26,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:26,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-14 18:57:26,136 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-14 18:57:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:26,145 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-14 18:57:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-14 18:57:26,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:26,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:26,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:26,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 18:57:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-14 18:57:26,148 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-14 18:57:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:26,148 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-14 18:57:26,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-14 18:57:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-14 18:57:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 18:57:26,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:26,183 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:26,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:57:26,187 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 35168483, now seen corresponding path program 1 times [2022-04-14 18:57:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:26,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458863764] [2022-04-14 18:57:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {153#true} is VALID [2022-04-14 18:57:26,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153#true} {153#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-14 18:57:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {153#true} is VALID [2022-04-14 18:57:26,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#true} {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-14 18:57:26,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {153#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:26,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {153#true} is VALID [2022-04-14 18:57:26,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {153#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {158#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-14 18:57:26,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(and (= main_~sn~0 0) (= main_~x~0 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-14 18:57:26,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(and (= main_~sn~0 0) (= main_~x~0 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {159#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:26,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-14 18:57:26,454 INFO L272 TraceCheckUtils]: 9: Hoare triple {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {153#true} is VALID [2022-04-14 18:57:26,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {153#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {153#true} is VALID [2022-04-14 18:57:26,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,459 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {153#true} {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-14 18:57:26,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-14 18:57:26,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {160#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {165#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-14 18:57:26,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {165#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {166#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-14 18:57:26,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {166#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {167#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 18:57:26,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#(not (= |__VERIFIER_assert_#in~cond| 0))} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {168#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 18:57:26,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {168#(not (= __VERIFIER_assert_~cond 0))} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {154#false} is VALID [2022-04-14 18:57:26,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {154#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#false} is VALID [2022-04-14 18:57:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458863764] [2022-04-14 18:57:26,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458863764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:57:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045415121] [2022-04-14 18:57:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:26,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:26,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 18:57:26,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 18:57:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 18:57:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:57:26,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {153#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {153#true} is VALID [2022-04-14 18:57:26,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {153#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {158#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-14 18:57:26,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(and (= main_~sn~0 0) (= main_~x~0 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-14 18:57:26,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(and (= main_~sn~0 0) (= main_~x~0 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {159#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:26,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:26,998 INFO L272 TraceCheckUtils]: 9: Hoare triple {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {153#true} is VALID [2022-04-14 18:57:26,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {153#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {153#true} is VALID [2022-04-14 18:57:26,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:26,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,000 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {153#true} {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:27,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:27,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {219#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-14 18:57:27,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {219#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {223#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-14 18:57:27,003 INFO L272 TraceCheckUtils]: 17: Hoare triple {223#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {227#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-14 18:57:27,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {227#(= |__VERIFIER_assert_#in~cond| 1)} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 18:57:27,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#(<= 1 __VERIFIER_assert_~cond)} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {154#false} is VALID [2022-04-14 18:57:27,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {154#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#false} is VALID [2022-04-14 18:57:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:27,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:57:27,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {154#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#false} is VALID [2022-04-14 18:57:27,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#(<= 1 __VERIFIER_assert_~cond)} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {154#false} is VALID [2022-04-14 18:57:27,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {244#(<= 1 |__VERIFIER_assert_#in~cond|)} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 18:57:27,649 INFO L272 TraceCheckUtils]: 17: Hoare triple {248#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 18:57:27,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {252#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {248#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-14 18:57:27,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {252#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-14 18:57:27,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:27,653 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {153#true} {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:27,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {153#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {153#true} is VALID [2022-04-14 18:57:27,654 INFO L272 TraceCheckUtils]: 9: Hoare triple {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {153#true} is VALID [2022-04-14 18:57:27,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {278#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {256#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:27,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {278#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:27,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {282#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-14 18:57:27,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {282#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-14 18:57:27,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {153#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {153#true} is VALID [2022-04-14 18:57:27,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {153#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#true} is VALID [2022-04-14 18:57:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:27,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045415121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:57:27,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:57:27,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-14 18:57:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168842101] [2022-04-14 18:57:27,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:57:27,662 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-04-14 18:57:27,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:27,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 18:57:27,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:27,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-14 18:57:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-14 18:57:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-14 18:57:27,706 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 18:57:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:28,334 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-14 18:57:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 18:57:28,335 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-04-14 18:57:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 18:57:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-14 18:57:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 18:57:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-14 18:57:28,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2022-04-14 18:57:28,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:28,377 INFO L225 Difference]: With dead ends: 39 [2022-04-14 18:57:28,377 INFO L226 Difference]: Without dead ends: 39 [2022-04-14 18:57:28,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2022-04-14 18:57:28,378 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:28,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 56 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 18:57:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-14 18:57:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-14 18:57:28,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:28,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 18:57:28,383 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 18:57:28,383 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 18:57:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:28,385 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-14 18:57:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-14 18:57:28,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:28,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:28,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-14 18:57:28,386 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-14 18:57:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:28,388 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-14 18:57:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-14 18:57:28,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:28,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:28,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:28,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 18:57:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-14 18:57:28,390 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2022-04-14 18:57:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:28,391 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-14 18:57:28,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 18:57:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-14 18:57:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 18:57:28,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:28,392 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:28,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 18:57:28,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:28,601 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -407833038, now seen corresponding path program 1 times [2022-04-14 18:57:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:28,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642226588] [2022-04-14 18:57:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {481#true} is VALID [2022-04-14 18:57:28,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {481#true} {481#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-14 18:57:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:28,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 18:57:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:28,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-14 18:57:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:28,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-14 18:57:28,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:28,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {481#true} is VALID [2022-04-14 18:57:28,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {486#(= main_~x~0 0)} is VALID [2022-04-14 18:57:28,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#(= main_~x~0 0)} is VALID [2022-04-14 18:57:28,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {486#(= main_~x~0 0)} is VALID [2022-04-14 18:57:28,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:28,732 INFO L272 TraceCheckUtils]: 9: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:28,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:28,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,733 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {481#true} {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:28,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:28,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:28,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:28,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:28,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:28,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,736 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {481#true} {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:28,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:28,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:28,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-14 18:57:28,737 INFO L272 TraceCheckUtils]: 25: Hoare triple {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:28,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:28,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:28,738 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {481#true} {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-14 18:57:28,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-14 18:57:28,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {497#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:28,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {482#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {482#false} is VALID [2022-04-14 18:57:28,739 INFO L272 TraceCheckUtils]: 33: Hoare triple {482#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {482#false} is VALID [2022-04-14 18:57:28,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {482#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-14 18:57:28,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {482#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:28,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {482#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 18:57:28,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642226588] [2022-04-14 18:57:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642226588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:57:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14892297] [2022-04-14 18:57:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:28,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:28,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 18:57:28,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 18:57:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 18:57:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:28,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:57:29,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {481#true} is VALID [2022-04-14 18:57:29,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {486#(= main_~x~0 0)} is VALID [2022-04-14 18:57:29,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#(= main_~x~0 0)} is VALID [2022-04-14 18:57:29,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {486#(= main_~x~0 0)} is VALID [2022-04-14 18:57:29,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:29,044 INFO L272 TraceCheckUtils]: 9: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:29,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:29,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,045 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {481#true} {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:29,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:29,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:29,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:29,047 INFO L272 TraceCheckUtils]: 17: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:29,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:29,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,048 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {481#true} {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:29,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:29,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:29,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:29,050 INFO L272 TraceCheckUtils]: 25: Hoare triple {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:29,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:29,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,052 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {481#true} {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:29,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:29,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:29,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {482#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {482#false} is VALID [2022-04-14 18:57:29,060 INFO L272 TraceCheckUtils]: 33: Hoare triple {482#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {482#false} is VALID [2022-04-14 18:57:29,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {482#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-14 18:57:29,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {482#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:29,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {482#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 18:57:29,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:57:29,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {482#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:29,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {482#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:29,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {482#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-14 18:57:29,211 INFO L272 TraceCheckUtils]: 33: Hoare triple {482#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {482#false} is VALID [2022-04-14 18:57:29,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {482#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {482#false} is VALID [2022-04-14 18:57:29,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {630#(< (mod main_~x~0 4294967296) 10)} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-14 18:57:29,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {630#(< (mod main_~x~0 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-14 18:57:29,212 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {481#true} {630#(< (mod main_~x~0 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {630#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-14 18:57:29,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:29,215 INFO L272 TraceCheckUtils]: 25: Hoare triple {630#(< (mod main_~x~0 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:29,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {630#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-14 18:57:29,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:29,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:29,216 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {481#true} {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:29,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:29,217 INFO L272 TraceCheckUtils]: 17: Hoare triple {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:29,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {652#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:29,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:29,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:29,219 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {481#true} {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:29,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {481#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-14 18:57:29,221 INFO L272 TraceCheckUtils]: 9: Hoare triple {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {481#true} is VALID [2022-04-14 18:57:29,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {702#(< (mod (+ main_~x~0 3) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {677#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:29,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {702#(< (mod (+ main_~x~0 3) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {702#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:29,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {702#(< (mod (+ main_~x~0 3) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {702#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:29,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {702#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:29,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {481#true} is VALID [2022-04-14 18:57:29,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-14 18:57:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 18:57:29,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14892297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:57:29,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:57:29,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-14 18:57:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900381237] [2022-04-14 18:57:29,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:57:29,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 37 [2022-04-14 18:57:29,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:29,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 18:57:29,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:29,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 18:57:29,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:29,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 18:57:29,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-14 18:57:29,265 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 18:57:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:29,798 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 18:57:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 18:57:29,798 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 37 [2022-04-14 18:57:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 18:57:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2022-04-14 18:57:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 18:57:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2022-04-14 18:57:29,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2022-04-14 18:57:29,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:29,868 INFO L225 Difference]: With dead ends: 59 [2022-04-14 18:57:29,868 INFO L226 Difference]: Without dead ends: 59 [2022-04-14 18:57:29,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-04-14 18:57:29,869 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:29,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 18:57:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-14 18:57:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-14 18:57:29,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:29,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 18:57:29,873 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 18:57:29,873 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 18:57:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:29,876 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 18:57:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-14 18:57:29,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:29,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:29,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-14 18:57:29,877 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-14 18:57:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:29,879 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-14 18:57:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-14 18:57:29,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:29,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:29,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:29,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 18:57:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-14 18:57:29,881 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 37 [2022-04-14 18:57:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:29,882 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-14 18:57:29,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 18:57:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-14 18:57:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-14 18:57:29,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:29,883 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:29,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 18:57:30,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 18:57:30,104 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 562981354, now seen corresponding path program 2 times [2022-04-14 18:57:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067799330] [2022-04-14 18:57:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {980#true} is VALID [2022-04-14 18:57:30,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {980#true} {980#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-14 18:57:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 18:57:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-14 18:57:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-14 18:57:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-14 18:57:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-14 18:57:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-14 18:57:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-14 18:57:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 18:57:30,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:30,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {980#true} is VALID [2022-04-14 18:57:30,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {985#(= main_~x~0 0)} is VALID [2022-04-14 18:57:30,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {985#(= main_~x~0 0)} is VALID [2022-04-14 18:57:30,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {985#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {985#(= main_~x~0 0)} is VALID [2022-04-14 18:57:30,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {985#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,335 INFO L272 TraceCheckUtils]: 9: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,336 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {980#true} {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,338 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {980#true} {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,339 INFO L272 TraceCheckUtils]: 25: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,340 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {980#true} {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,341 INFO L272 TraceCheckUtils]: 33: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,342 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {980#true} {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,343 INFO L272 TraceCheckUtils]: 41: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,344 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {980#true} {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,345 INFO L272 TraceCheckUtils]: 49: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,346 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {980#true} {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,347 INFO L272 TraceCheckUtils]: 57: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,347 INFO L290 TraceCheckUtils]: 60: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,348 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {980#true} {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,349 INFO L290 TraceCheckUtils]: 64: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 18:57:30,349 INFO L272 TraceCheckUtils]: 65: Hoare triple {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,349 INFO L290 TraceCheckUtils]: 66: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,349 INFO L290 TraceCheckUtils]: 67: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,349 INFO L290 TraceCheckUtils]: 68: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,350 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {980#true} {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 18:57:30,350 INFO L290 TraceCheckUtils]: 70: Hoare triple {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 18:57:30,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {1021#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:30,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {981#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {981#false} is VALID [2022-04-14 18:57:30,351 INFO L272 TraceCheckUtils]: 73: Hoare triple {981#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {981#false} is VALID [2022-04-14 18:57:30,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {981#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#false} is VALID [2022-04-14 18:57:30,351 INFO L290 TraceCheckUtils]: 75: Hoare triple {981#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:30,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {981#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 18:57:30,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067799330] [2022-04-14 18:57:30,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067799330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:57:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418848338] [2022-04-14 18:57:30,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 18:57:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:30,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 18:57:30,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 18:57:30,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 18:57:30,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 18:57:30,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 18:57:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:57:30,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {980#true} is VALID [2022-04-14 18:57:30,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {985#(= main_~x~0 0)} is VALID [2022-04-14 18:57:30,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {985#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {985#(= main_~x~0 0)} is VALID [2022-04-14 18:57:30,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {985#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {985#(= main_~x~0 0)} is VALID [2022-04-14 18:57:30,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {985#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,896 INFO L272 TraceCheckUtils]: 9: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,900 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {980#true} {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 18:57:30,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {986#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,901 INFO L272 TraceCheckUtils]: 17: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,902 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {980#true} {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 18:57:30,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,903 INFO L272 TraceCheckUtils]: 25: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,904 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {980#true} {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 18:57:30,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {996#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,905 INFO L272 TraceCheckUtils]: 33: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,906 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {980#true} {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 18:57:30,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {1001#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,907 INFO L272 TraceCheckUtils]: 41: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,908 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {980#true} {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 18:57:30,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {1006#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,910 INFO L272 TraceCheckUtils]: 49: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,927 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {980#true} {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 18:57:30,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,928 INFO L272 TraceCheckUtils]: 57: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,929 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {980#true} {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,930 INFO L290 TraceCheckUtils]: 63: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 18:57:30,931 INFO L290 TraceCheckUtils]: 64: Hoare triple {1016#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 18:57:30,931 INFO L272 TraceCheckUtils]: 65: Hoare triple {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:30,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:30,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:30,931 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {980#true} {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 18:57:30,932 INFO L290 TraceCheckUtils]: 70: Hoare triple {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 18:57:30,932 INFO L290 TraceCheckUtils]: 71: Hoare triple {1222#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:30,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {981#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {981#false} is VALID [2022-04-14 18:57:30,932 INFO L272 TraceCheckUtils]: 73: Hoare triple {981#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {981#false} is VALID [2022-04-14 18:57:30,932 INFO L290 TraceCheckUtils]: 74: Hoare triple {981#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#false} is VALID [2022-04-14 18:57:30,932 INFO L290 TraceCheckUtils]: 75: Hoare triple {981#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:30,933 INFO L290 TraceCheckUtils]: 76: Hoare triple {981#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 18:57:30,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:57:31,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {981#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:31,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {981#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:31,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {981#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {981#false} is VALID [2022-04-14 18:57:31,316 INFO L272 TraceCheckUtils]: 73: Hoare triple {981#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {981#false} is VALID [2022-04-14 18:57:31,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {981#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {981#false} is VALID [2022-04-14 18:57:31,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {1274#(< (mod main_~x~0 4294967296) 10)} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {981#false} is VALID [2022-04-14 18:57:31,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {1274#(< (mod main_~x~0 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1274#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-14 18:57:31,317 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {980#true} {1274#(< (mod main_~x~0 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1274#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-14 18:57:31,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,317 INFO L290 TraceCheckUtils]: 67: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,317 INFO L272 TraceCheckUtils]: 65: Hoare triple {1274#(< (mod main_~x~0 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1274#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-14 18:57:31,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:31,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:31,319 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {980#true} {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:31,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,319 INFO L272 TraceCheckUtils]: 57: Hoare triple {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1296#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-14 18:57:31,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:31,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:31,321 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {980#true} {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:31,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,322 INFO L272 TraceCheckUtils]: 49: Hoare triple {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1321#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-14 18:57:31,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:31,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:31,324 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {980#true} {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:31,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,324 INFO L272 TraceCheckUtils]: 41: Hoare triple {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1346#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-14 18:57:31,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-14 18:57:31,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-14 18:57:31,326 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {980#true} {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-14 18:57:31,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,326 INFO L272 TraceCheckUtils]: 33: Hoare triple {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1371#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-14 18:57:31,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,328 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {980#true} {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,330 INFO L272 TraceCheckUtils]: 25: Hoare triple {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1396#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-14 18:57:31,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-14 18:57:31,331 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {980#true} {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-14 18:57:31,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,332 INFO L272 TraceCheckUtils]: 17: Hoare triple {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1421#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-14 18:57:31,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,333 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {980#true} {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {980#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {980#true} [67] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {980#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {980#true} is VALID [2022-04-14 18:57:31,335 INFO L272 TraceCheckUtils]: 9: Hoare triple {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {980#true} is VALID [2022-04-14 18:57:31,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#(< (mod (+ main_~x~0 8) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1446#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-14 18:57:31,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#(< (mod (+ main_~x~0 8) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1471#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-14 18:57:31,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#(< (mod (+ main_~x~0 8) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-14 18:57:31,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {1471#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-14 18:57:31,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {980#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {980#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {980#true} is VALID [2022-04-14 18:57:31,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {980#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {980#true} is VALID [2022-04-14 18:57:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 18:57:31,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418848338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:57:31,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:57:31,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-14 18:57:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226811397] [2022-04-14 18:57:31,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:57:31,340 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 77 [2022-04-14 18:57:31,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:31,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 18:57:31,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:31,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-14 18:57:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:31,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-14 18:57:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-04-14 18:57:31,411 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 18:57:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:32,569 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-14 18:57:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 18:57:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 77 [2022-04-14 18:57:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 18:57:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-04-14 18:57:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 18:57:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-04-14 18:57:32,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 67 transitions. [2022-04-14 18:57:32,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:32,624 INFO L225 Difference]: With dead ends: 67 [2022-04-14 18:57:32,624 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 18:57:32,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-04-14 18:57:32,625 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:32,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 81 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 18:57:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 18:57:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-14 18:57:32,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:32,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 18:57:32,629 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 18:57:32,629 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 18:57:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:32,631 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-14 18:57:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-14 18:57:32,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:32,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:32,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-14 18:57:32,632 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-14 18:57:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:32,634 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-14 18:57:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-14 18:57:32,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:32,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:32,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:32,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 18:57:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-14 18:57:32,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 77 [2022-04-14 18:57:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:32,637 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-14 18:57:32,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 18:57:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-14 18:57:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-14 18:57:32,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:32,639 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:32,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 18:57:32,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:32,856 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1970006374, now seen corresponding path program 3 times [2022-04-14 18:57:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:32,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054818895] [2022-04-14 18:57:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:57:32,964 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 18:57:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:57:33,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 18:57:33,030 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 18:57:33,031 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 18:57:33,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 18:57:33,041 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-14 18:57:33,044 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 18:57:33,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:57:33 BasicIcfg [2022-04-14 18:57:33,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 18:57:33,090 INFO L158 Benchmark]: Toolchain (without parser) took 8328.67ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 148.4MB in the beginning and 191.4MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:57:33,090 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory was 164.7MB in the beginning and 164.7MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:57:33,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.18ms. Allocated memory is still 199.2MB. Free memory was 148.2MB in the beginning and 174.6MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 18:57:33,091 INFO L158 Benchmark]: Boogie Preprocessor took 18.80ms. Allocated memory is still 199.2MB. Free memory was 174.6MB in the beginning and 173.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 18:57:33,091 INFO L158 Benchmark]: RCFGBuilder took 236.14ms. Allocated memory is still 199.2MB. Free memory was 173.1MB in the beginning and 162.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 18:57:33,091 INFO L158 Benchmark]: IcfgTransformer took 24.09ms. Allocated memory is still 199.2MB. Free memory was 162.7MB in the beginning and 161.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 18:57:33,091 INFO L158 Benchmark]: TraceAbstraction took 7890.78ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 160.6MB in the beginning and 191.4MB in the end (delta: -30.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-14 18:57:33,092 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.10ms. Allocated memory is still 199.2MB. Free memory was 164.7MB in the beginning and 164.7MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 151.18ms. Allocated memory is still 199.2MB. Free memory was 148.2MB in the beginning and 174.6MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.80ms. Allocated memory is still 199.2MB. Free memory was 174.6MB in the beginning and 173.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 236.14ms. Allocated memory is still 199.2MB. Free memory was 173.1MB in the beginning and 162.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 24.09ms. Allocated memory is still 199.2MB. Free memory was 162.7MB in the beginning and 161.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7890.78ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 160.6MB in the beginning and 191.4MB in the end (delta: -30.8MB). Peak memory consumption was 9.8MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; VAL [loop1=50, n1=51, sn=0, x=0] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=0, x=0] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=2, x=0] [L28] x++ VAL [loop1=50, n1=51, sn=2, x=1] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=2, x=1] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=2, x=1] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=4, x=1] [L28] x++ VAL [loop1=50, n1=51, sn=4, x=2] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=4, x=2] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=4, x=2] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=6, x=2] [L28] x++ VAL [loop1=50, n1=51, sn=6, x=3] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=6, x=3] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=6, x=3] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=8, x=3] [L28] x++ VAL [loop1=50, n1=51, sn=8, x=4] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=8, x=4] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=8, x=4] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=10, x=4] [L28] x++ VAL [loop1=50, n1=51, sn=10, x=5] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=10, x=5] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=10, x=5] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=12, x=5] [L28] x++ VAL [loop1=50, n1=51, sn=12, x=6] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=12, x=6] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=12, x=6] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=14, x=6] [L28] x++ VAL [loop1=50, n1=51, sn=14, x=7] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=14, x=7] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=14, x=7] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=16, x=7] [L28] x++ VAL [loop1=50, n1=51, sn=16, x=8] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=16, x=8] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=16, x=8] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=18, x=8] [L28] x++ VAL [loop1=50, n1=51, sn=18, x=9] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=18, x=9] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=18, x=9] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=20, x=9] [L28] x++ VAL [loop1=50, n1=51, sn=20, x=10] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=20, x=10] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=20, x=10] [L25] COND FALSE !(x<10) VAL [loop1=50, n1=51, sn=20, x=10] [L28] x++ VAL [loop1=50, n1=51, sn=20, x=11] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 73 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1670 SizeOfPredicates, 6 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 510/960 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-14 18:57:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...